On the public citation graph

An improved refutation system for intuitionistic predicate logic

https://doi.org/10.1007/bf00881949

0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10828-9_72openalex-snapshot

Trees in Kripke models and in an intuitionistic refutation system

inferredcites →https://doi.org/10.1007/978-94-017-2977-2openalex-snapshot

Semantical Investigations in Heyting’s Intuitionistic Logic

inferredcites →https://doi.org/10.1007/bfb0066744openalex-snapshot

Applications of Kripke models

inferredcites →https://doi.org/10.1016/s0049-237x(08)71127-3openalex-snapshot

Aspects of Constructive Mathematics

inferredcites →https://doi.org/10.1016/s0049-237x(08)71685-9openalex-snapshot

Semantical Analysis of Intuitionistic Logic I

inferredcites →https://doi.org/10.1016/s0049-237x(08)x7038-7openalex-snapshot

Intuitionistic Logic Model Theory and Forcing

inferredcites →https://doi.org/10.2307/2275431openalex-snapshot

Contraction-free sequent calculi for intuitionistic logic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-59338-1_30openalex-snapshot

Refutation systems for prepositional modal logics

inferred← citeshttps://doi.org/10.1007/3-540-61208-4_20openalex-snapshot

Proof-search in intuitionistic logic based on constraint satisfaction

inferred← citeshttps://doi.org/10.1007/3-540-61208-4_4openalex-snapshot

Almost duplication-free tableau calculi for prepositional lax logics

inferred← citeshttps://doi.org/10.1007/3-540-61208-4_5openalex-snapshot

Combining many-valued and intuitionistic tableaux

inferred← citeshttps://doi.org/10.1007/3-540-63104-6_15openalex-snapshot

Deciding intuitionistic propositional logic via translation into classical logic

inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_5openalex-snapshot

Advanced Many-Valued Logics

inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_1openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_11openalex-snapshot

A Bibliography on Analytic Tableaux Theorem Proving

inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_5openalex-snapshot

Tableaux for Intuitionistic Logics

inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_9openalex-snapshot

Tableaux for Many-Valued Logics

inferred← citeshttps://doi.org/10.1007/bfb0027403openalex-snapshot

Tableaux for logic programming with strong negation

inferred← citeshttps://doi.org/10.1007/bfb0027404openalex-snapshot

Generalized tableau systems for intermediate propositional logics

inferred← citeshttps://doi.org/10.1007/s10817-012-9252-7openalex-snapshot

Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.013openalex-snapshot

Optimization techniques for propositional intuitionistic logic and their implementation

inferred← citeshttps://doi.org/10.1023/a:1005072627389openalex-snapshot

Cut-Free Tableau Calculi for some Intuitionistic Modal Logics

inferred← citeshttps://doi.org/10.1023/a:1017515831550openalex-snapshot

An O(nlog n)-SPACE Decision Procedure for the Propositional Dummett Logic

inferred← citeshttps://doi.org/10.1023/a:1022981105345openalex-snapshot

Preface. In Memoriam Pierangelo Miglioli (1946–1999)

inferred← citeshttps://doi.org/10.1023/a:1022989323091openalex-snapshot

Tableaux for Łukasiewicz Infinite-valued Logic

inferred← citeshttps://doi.org/10.1093/jigpal/9.1.1openalex-snapshot

How to avoid the formal verification of a theorem prover

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.