On the public citation graph
A propositional logic with explicit fixed points
0 signed · 125 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00258073openalex-snapshot
Provability, truth, and modal logic
inferredcites →https://doi.org/10.1007/bf00493670openalex-snapshot
Calculating self-referential statements, I: Explicit calculations
inferredcites →https://doi.org/10.1007/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1007/bfb0066739openalex-snapshot
Metamathematical Investigation of Intuitionistic Arithmetic and Analysis
inferredcites →https://doi.org/10.1093/oso/9780198505242.001.0001openalex-snapshot
Elements of Intuitionism
inferredcites →https://doi.org/10.1111/j.1468-0149.1978.tb00089.xopenalex-snapshot
ELEMENTS OF INTUITIONISM
inferredcites →https://doi.org/10.1111/j.1755-2567.1978.tb00831.xopenalex-snapshot
Arithmetical necessity, provability and intuitionistic logic
inferredcites →https://doi.org/10.1201/9781482283013-18openalex-snapshot
Unprovability of Consistency
inferredcites →https://doi.org/10.2307/2964753openalex-snapshot
A propositional calculus with denumerable matrix
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19980440304openalex-snapshot
Basic Propositional Calculus I
inferred← citeshttps://doi.org/10.1002/malq.200310032openalex-snapshot
Provably total functions of Basic Arithmetic
inferred← citeshttps://doi.org/10.1002/malq.200310056openalex-snapshot
New sequent calculi for Visser's Formal Propositional Logic
inferred← citeshttps://doi.org/10.1002/malq.200310077openalex-snapshot
On the linear Lindenbaum algebra of Basic Propositional Logic
inferred← citeshttps://doi.org/10.1002/malq.200410001openalex-snapshot
On weakening the Deduction Theorem and strengthening Modus Ponens
inferred← citeshttps://doi.org/10.1002/malq.200410022openalex-snapshot
Bounded distributive lattices with strict implication
inferred← citeshttps://doi.org/10.1002/malq.202200073openalex-snapshot
On self‐distributive weak Heyting algebras
inferred← citeshttps://doi.org/10.1007/978-3-030-53654-1openalex-snapshot
Mathematics, Logic, and their Philosophies
inferred← citeshttps://doi.org/10.1007/978-3-030-53654-1_2openalex-snapshot
Binary Modal Companions for Subintuitionistic Logics
inferred← citeshttps://doi.org/10.1007/978-3-030-53654-1_4openalex-snapshot
Residuated Expansions of Lattice-Ordered Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-53654-1_7openalex-snapshot
Implication via Spacetime
inferred← citeshttps://doi.org/10.1007/978-3-540-73099-6_13openalex-snapshot
Tree-Sequent Methods for Subintuitionistic Predicate Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_7openalex-snapshot
Completions of Basic Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-15349-5_10openalex-snapshot
The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
inferred← citeshttps://doi.org/10.1007/978-3-662-46906-4_15openalex-snapshot
Alternative Semantics for Visser’s Propositional Logics
inferred← citeshttps://doi.org/10.1007/978-3-662-48357-2_11openalex-snapshot
Constructive Embedding from Extensions of Logics of Strict Implication into Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-662-54332-0_18openalex-snapshot
Subintuitionistic Logics with Kripke Semantics
inferred← citeshttps://doi.org/10.1007/978-94-015-8242-1_4openalex-snapshot
Modal Translations in K and D
inferred← citeshttps://doi.org/10.1007/978-94-017-0466-3_3openalex-snapshot
Semantics and the Liar Paradox
inferred← citeshttps://doi.org/10.1007/978-94-017-8860-1_4openalex-snapshot
Easkia Duality and Its Extensions
inferred← citeshttps://doi.org/10.1007/978-981-10-6355-8_12openalex-snapshot
Proof-Theoretic Embedding from Visser’s Basic Propositional Logic to Modal Logic K4 via Non-labelled Sequent Calculi
inferred← citeshttps://doi.org/10.1007/bf00370331openalex-snapshot
Modal companions of intermediate propositional logics
inferred← citeshttps://doi.org/10.1007/pl00003844openalex-snapshot
Basic Propositional Calculus II. Interpolation
inferred← citeshttps://doi.org/10.1007/s00012-023-00830-8openalex-snapshot
Choice-free topological duality for implicative lattices and Heyting algebras
inferred← citeshttps://doi.org/10.1007/s00153-014-0394-7openalex-snapshot
The de Jongh property for Basic Arithmetic
inferred← citeshttps://doi.org/10.1007/s00153-024-00945-2openalex-snapshot
Bounded distributive lattices with strict implication and weak difference
inferred← citeshttps://doi.org/10.1007/s00153-025-00979-0openalex-snapshot
Algebraic semantics for weak subintuitionistic logic WF
inferred← citeshttps://doi.org/10.1007/s001530100132openalex-snapshot
A Gentzen-style axiomatization for basic predicate calculus
inferred← citeshttps://doi.org/10.1007/s00500-016-2387-4openalex-snapshot
Kripke semantics for fuzzy logics
inferred← citeshttps://doi.org/10.1007/s00500-021-05777-3openalex-snapshot
Representations of Sheffer stroke algebras and Visser algebras
inferred← citeshttps://doi.org/10.1007/s11225-013-9500-9openalex-snapshot
Categorical Abstract Algebraic Logic: Referential Algebraic Semantics
inferred← citeshttps://doi.org/10.1007/s11225-017-9765-5openalex-snapshot
Latarres, Lattices with an Arrow
inferred← citeshttps://doi.org/10.1007/s11225-018-9815-7openalex-snapshot
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter
inferred← citeshttps://doi.org/10.1007/s11225-020-09900-7openalex-snapshot
A Canonical Model for Constant Domain Basic First-Order Logic
inferred← citeshttps://doi.org/10.1007/s11225-023-10065-2openalex-snapshot
Intuitionistic Modal Algebras
inferred← citeshttps://doi.org/10.1007/s11225-023-10093-yopenalex-snapshot
Variations on the Kripke Trick
inferred← citeshttps://doi.org/10.1007/s11225-024-10110-8openalex-snapshot
On a Generalization of Heyting Algebras I
inferred← citeshttps://doi.org/10.1007/s11225-024-10112-6openalex-snapshot
On Weak Lewis Distributive Lattices
inferred← citeshttps://doi.org/10.1007/s11225-025-10186-wopenalex-snapshot
A Unified Relational Semantics for BPL, IPL and OL: Axiomatization Without Disjunction
inferred← citeshttps://doi.org/10.1007/s11225-025-10227-4openalex-snapshot
A Cut-free Sequent Calculus for Basic Intuitionistic Dynamic Topological Logic
inferred← citeshttps://doi.org/10.1007/s11225-026-10265-6openalex-snapshot
Sequent Calculus for the Subintuitionistic Logic $$\mathsf{WF_{N_{2}}} $$
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90024-9openalex-snapshot
On the completenes principle: A study of provability in heyting's arithmetic and extensions
inferred← citeshttps://doi.org/10.1016/j.apal.2012.10.013openalex-snapshot
Order algebraizable logics
inferred← citeshttps://doi.org/10.1016/j.apal.2016.11.001openalex-snapshot
On non-self-referential fragments of modal logics
inferred← citeshttps://doi.org/10.1016/j.apal.2021.102972openalex-snapshot
Proof complexity of substructural logics
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103360openalex-snapshot
Extensions of Solovay's system S without independent sets of axioms
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103811openalex-snapshot
Superintuitionistic predicate logics of linear Kripke frames: undecidability with two individual variables
inferred← citeshttps://doi.org/10.1017/jsl.2021.67openalex-snapshot
ON EQUATIONAL COMPLETENESS THEOREMS
inferred← citeshttps://doi.org/10.1017/s175502032000043xopenalex-snapshot
BINARY KRIPKE SEMANTICS FOR A STRONG LOGIC FOR NAIVE TRUTH
inferred← citeshttps://doi.org/10.1017/s1755020322000272openalex-snapshot
COLLECTION FRAMES FOR DISTRIBUTIVE SUBSTRUCTURAL LOGICS
inferred← citeshttps://doi.org/10.1023/a:1005196310070openalex-snapshot
A Translation of Intuitionistic Predicate Logic into Basic Predicate Logic
inferred← citeshttps://doi.org/10.1023/a:1005298819843openalex-snapshot
Basic Logic, K4, and Persistence
inferred← citeshttps://doi.org/10.1023/a:1008237600846openalex-snapshot
Speaking about Transitive Frames in Propositional Languages
inferred← citeshttps://doi.org/10.1023/a:1012499207246openalex-snapshot
Gentzen-Style Axiomatizations for Some Conservative Extensions of Basic Propositional Logic
inferred← citeshttps://doi.org/10.1023/a:1019915908844openalex-snapshot
Kripke Semantics for Modal Substructural Logics
inferred← citeshttps://doi.org/10.1023/a:1022363219134openalex-snapshot
A Cut-Free Gentzen Formulation of Basic Propositional Calculus
inferred← citeshttps://doi.org/10.1023/b:logi.0000003928.44012.57openalex-snapshot
Normal Modal Substructural Logics with Strong Negation
inferred← citeshttps://doi.org/10.1080/11663081.2024.2366756openalex-snapshot
Subintuitionistic logics and their modal companions: a nested approach
inferred← citeshttps://doi.org/10.1080/11663081.2025.2551996openalex-snapshot
A semantical analysis of some subintuitionistic modal logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzac067openalex-snapshot
Kolmogorov and Kuroda translations into basic predicate logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzac083openalex-snapshot
Binary modal logic and unary modal logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzad002openalex-snapshot
Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness
inferred← citeshttps://doi.org/10.1093/jigpal/jzm004openalex-snapshot
A Tree-Sequent Calculus for a Natural Predicate Extension of Visser's Propositional Logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzm058openalex-snapshot
Sequent Calculi for Some Strict Implication Logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzs002openalex-snapshot
A unification of the basic logics of Sambin and Visser
inferred← citeshttps://doi.org/10.1093/jigpal/jzy052openalex-snapshot
Basic propositional logic and the weak excluded middle
inferred← citeshttps://doi.org/10.1093/logcom/exaa091openalex-snapshot
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
inferred← citeshttps://doi.org/10.1093/logcom/exad078openalex-snapshot
Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames
inferred← citeshttps://doi.org/10.1093/logcom/exae060openalex-snapshot
Propositional logic and modal logic—A connection via relational semantics
inferred← citeshttps://doi.org/10.1093/logcom/exw012openalex-snapshot
Unified correspondence and proof theory for strict implication
inferred← citeshttps://doi.org/10.1134/s0001434615110073openalex-snapshot
On hyperarithmetical realizability
inferred← citeshttps://doi.org/10.1134/s000143462201028xopenalex-snapshot
Basic Predicate Calculus is not Sound with Respect to the Strong Variant of Strictly Primitive Recursive Realizability
inferred← citeshttps://doi.org/10.1134/s0001434623110585openalex-snapshot
Basic Predicate Calculus is Sound with Respect to a Modified Version of Strictly Primitive Recursive Realizability
inferred← citeshttps://doi.org/10.1142/s0218196708004627openalex-snapshot
ASSERTIONALLY EQUIVALENT QUASIVARIETIES
inferred← citeshttps://doi.org/10.1145/3468856openalex-snapshot
Generalized Realizability and Basic Logic
inferred← citeshttps://doi.org/10.1215/00294527-1715653openalex-snapshot
Provability and Interpretability Logics with Restricted Realizations
inferred← citeshttps://doi.org/10.1215/00294527-2022-0014openalex-snapshot
Monotone Subintuitionistic Logic: Duality and Transfer Results
inferred← citeshttps://doi.org/10.1215/00294527-3339473openalex-snapshot
Boolean Algebras in Visser Algebras
inferred← citeshttps://doi.org/10.12775/llp.2015.015openalex-snapshot
Neighborhood Semantics for Basic and Intuitionistic Logic
inferred← citeshttps://doi.org/10.1305/euclid.ndjfl/1054301352openalex-snapshot
Sequent Calculi for Visser's Propositional Logics
inferred← citeshttps://doi.org/10.1305/ndjfl/1054301352openalex-snapshot
Sequent Calculi for Visser's Propositional Logics
inferred← citeshttps://doi.org/10.1305/ndjfl/1063372244openalex-snapshot
A Closer Look at Some Subintuitionistic Logics
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635927openalex-snapshot
On the $\Sigma^0_1$-conservativity of $\Sigma^0_1$-completeness.
inferred← citeshttps://doi.org/10.18778/0138-0680.2021.22openalex-snapshot
Sequent Calculi for Orthologic with Strict Implication
inferred← citeshttps://doi.org/10.18778/0138-0680.2022.18openalex-snapshot
Interpolation Property on Visser's Formal Propositional Logic
inferred← citeshttps://doi.org/10.18778/0138-0680.2024.13openalex-snapshot
Open Filters and Congruence Relations on Self-Distributive Weak Heyting Algebras
inferred← citeshttps://doi.org/10.18778/0138-0680.2024.15openalex-snapshot
D-complete Single Axioms for the Equivalential Calculus with the rules D and R
inferred← citeshttps://doi.org/10.2168/lmcs-8(2:3)2012openalex-snapshot
Intuitionistic implication makes model checking hard
inferred← citeshttps://doi.org/10.2178/bsl/1146620064openalex-snapshot
2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
inferred← citeshttps://doi.org/10.2178/jsl/1154698583openalex-snapshot
Correspondences between gentzen and hilbert systems
inferred← citeshttps://doi.org/10.2307/2687834openalex-snapshot
2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000
inferred← citeshttps://doi.org/10.2307/420948openalex-snapshot
European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/421141openalex-snapshot
1998 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/421175openalex-snapshot
1995–1996 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.26907/0021-3446-2023-11-15-25openalex-snapshot
On a modification of Visser’s formal logic and its connection with Solovay’s modal logic
inferred← citeshttps://doi.org/10.3103/s1066369x23110051openalex-snapshot
A Modification of Visser’s Formal Logic and Its Connection with Solovay’s Modal Logic
inferred← citeshttps://doi.org/10.3166/jancl.17.359-382openalex-snapshot
Complexity of finite-variable fragments M of EXPTIME-complete logics
inferred← citeshttps://doi.org/10.3166/jancl.18.267-292openalex-snapshot
Complexity of intuitionistic propositional logic and its fragments
inferred← citeshttps://doi.org/10.3390/logics1010004openalex-snapshot
A Fundamental Non-Classical Logic
inferred← citeshttps://doi.org/10.35537/10915/161760openalex-snapshot
Estudio de álgebras de Heyting débiles con operadores modales
inferred← citeshttps://doi.org/10.4213/im9288openalex-snapshot
Неарифметичность предикатной логики примитивно рекурсивной реализуемости
inferred← citeshttps://doi.org/10.4213/im9288eopenalex-snapshot
The nonarithmeticity of the predicate logic of primitive recursive realizability
inferred← citeshttps://doi.org/10.4213/mzm13203openalex-snapshot
Некорректность базисной логики предикатов относительно сильного варианта строгой примитивно-рекурсивной реализуемости
inferred← citeshttps://doi.org/10.4213/mzm13723openalex-snapshot
Корректность базисной логики предикатов относительно модифицированного варианта строгой примитивно-рекурсивной реализуемости
inferred← citeshttps://doi.org/10.48550/arxiv.1704.07679openalex-snapshot
Russellian Propositional Logic and the BHK Interpretation
inferred← citeshttps://doi.org/10.48550/arxiv.1711.01736openalex-snapshot
Geometric Modality and Weak Exponentials
inferred← citeshttps://doi.org/10.48550/arxiv.2006.10539openalex-snapshot
Provability and interpretability logics with restricted realizations
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.