On the public citation graph
Rules of inference with parameters for intuitionistic logic
0 signed · 79 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/978-3-642-88664-5openalex-snapshot
Vollständige Systeme modaler und intuitionistischer Logik
inferredcites →https://doi.org/10.1007/bf01157678openalex-snapshot
Elementary theories of free topo-Boolean and pseudo-Boolean algebras
inferredcites →https://doi.org/10.1007/bf01982031openalex-snapshot
A criterion for admissibility of rules in the model system S4 and the intuitionistic logic
inferredcites →https://doi.org/10.1070/im1987v028n03abeh000902openalex-snapshot
DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
inferredcites →https://doi.org/10.2307/2271891openalex-snapshot
One hundred and two problems in mathematical logic
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.19930390144openalex-snapshot
Intermediate logics preserving admissible inference rules of heyting calculus
inferred← citeshttps://doi.org/10.1002/malq.19990450409openalex-snapshot
On Finite Model Property for Admissible Rules
inferred← citeshttps://doi.org/10.1007/11753728_33openalex-snapshot
Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-47921-2_1openalex-snapshot
Notes on My Scientific Life
inferred← citeshttps://doi.org/10.1007/978-3-031-68934-5_16openalex-snapshot
Investigating Definability in Propositional Logic via Sheaves on Grothendieck Topologies
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_4openalex-snapshot
Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
inferred← citeshttps://doi.org/10.1007/978-3-540-69731-2_116openalex-snapshot
Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_34openalex-snapshot
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-04592-9_3openalex-snapshot
Temporal Logic for Modeling Discovery and Logical Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-642-13232-2_41openalex-snapshot
Multi-agent Logic with Distances Based on Linear Temporal Frames
inferred← citeshttps://doi.org/10.1007/978-3-642-15390-7_23openalex-snapshot
Reasoning and Inference Rules in Basic Linear Temporal Logic $\mathcal{BLTL}$
inferred← citeshttps://doi.org/10.1007/978-3-642-15393-8_37openalex-snapshot
Interpretation of Chance Discovery in Temporal Logic, Admissible Inference Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-21884-2_4openalex-snapshot
Inference Rules in Multi-agents’ Temporal Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-23851-2_32openalex-snapshot
Representation of Knowledge and Uncertainty in Temporal Logic LTL with Since on Frames Z of Integer Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-23863-5_49openalex-snapshot
Chance Discovery and Unification in Linear Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-30114-8_12openalex-snapshot
Temporal Logics Modeling Logical Uncertainty, Local and Global Chance Discovery
inferred← citeshttps://doi.org/10.1007/978-3-662-54332-0_13openalex-snapshot
Universal Models for the Positive Fragment of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-8860-1_2openalex-snapshot
Canonical Extensions, Esakia Spaces, and Universal Models
inferred← citeshttps://doi.org/10.1007/bf01054709openalex-snapshot
Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
inferred← citeshttps://doi.org/10.1007/bf02681666openalex-snapshot
Independent bases for admissible rules in pretable logics
inferred← citeshttps://doi.org/10.1007/s00153-025-00974-5openalex-snapshot
On the theory of epistemic Łukasiewicz logic corresponding to the Chang algebra with application in Immune system
inferred← citeshttps://doi.org/10.1007/s00224-007-9059-9openalex-snapshot
Branching Time Logics $\mathcal {BTL}^{\mathrm {U,S}}_{\mathrm {N},\mathrm {N}^{-1}}(\mathcal {Z})_{\alpha }$ with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms
inferred← citeshttps://doi.org/10.1007/s10469-022-09677-9openalex-snapshot
Multi-Agent Logics with Dynamic Accessibly Relations, Projective Unifiers
inferred← citeshttps://doi.org/10.1007/s10469-023-09708-zopenalex-snapshot
Dynamic Temporal Logical Operations in Multi-Agent Logics
inferred← citeshttps://doi.org/10.1007/s10469-024-09743-4openalex-snapshot
Multi-Agent Temporal Logics, Information, Unification, and Projectivity
inferred← citeshttps://doi.org/10.1007/s11225-008-9147-0openalex-snapshot
Frame Based Formulas for Intermediate Logics
inferred← citeshttps://doi.org/10.1007/s11225-011-9354-yopenalex-snapshot
Best Unifiers in Transitive Modal Logics
inferred← citeshttps://doi.org/10.1007/s11225-012-9389-8openalex-snapshot
Extendible Formulas in Two Variables in Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/s11225-015-9642-zopenalex-snapshot
Admissible Bases Via Stable Canonical Rules
inferred← citeshttps://doi.org/10.1007/s11225-022-10012-7openalex-snapshot
Hereditarily Structurally Complete Intermediate Logics: Citkin’s Theorem Via Duality
inferred← citeshttps://doi.org/10.1007/s11787-014-0110-8openalex-snapshot
Inference Rules in Nelson’s Logics, Admissibility and Weak Admissibility
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.010openalex-snapshot
Unification, finite duality and projectivity in varieties of Heyting algebras
inferred← citeshttps://doi.org/10.1016/j.apal.2008.03.001openalex-snapshot
Linear temporal logic with until and next, logical consecutions
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.004openalex-snapshot
Unification in linear temporal logic LTL
inferred← citeshttps://doi.org/10.1016/j.apal.2013.01.001openalex-snapshot
Unification and admissible rules for paraconsistent minimal Johanssonsʼ logic J and positive intuitionistic logic IPC+
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.04.003openalex-snapshot
A Tableau Method for Checking Rule Admissibility in S4
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.012openalex-snapshot
Rules admissible in transitive temporal logic TS4 , sufficient condition
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00081-1openalex-snapshot
Substitutions of Σ10-sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic
inferred← citeshttps://doi.org/10.1017/bsl.2020.43openalex-snapshot
DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
inferred← citeshttps://doi.org/10.1017/jsl.2025.10150openalex-snapshot
RELATIVE UNIFICATION IN INTUITIONISTIC LOGIC: TOWARDS THE PROVABILITY LOGIC OF HA
inferred← citeshttps://doi.org/10.1023/a:1010226820231openalex-snapshot
Describing a Basis in Semireduced Form for Inference Rules of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1023/a:1012557903153openalex-snapshot
Residual Finiteness for Admissible Inference Rules
inferred← citeshttps://doi.org/10.1080/01445340.2018.1439257openalex-snapshot
The Context of Inference
inferred← citeshttps://doi.org/10.1093/jigpal/jzq008openalex-snapshot
Unification in modal and description logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzs015openalex-snapshot
Writing out unifiers for formulas with coefficients in intuitionistic logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzs038openalex-snapshot
Unifiers in transitive modal logics for formulas with coefficients (meta-variables)
inferred← citeshttps://doi.org/10.1093/jigpal/jzu005openalex-snapshot
Projective formulas and unification in linear temporal logic LTLU
inferred← citeshttps://doi.org/10.1093/logcom/exm078openalex-snapshot
Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
inferred← citeshttps://doi.org/10.1093/logcom/exp027openalex-snapshot
Linear Temporal Logic LTLK extended by Multi-Agent Logic Kn with Interacting Agents
inferred← citeshttps://doi.org/10.1093/logcom/exq020openalex-snapshot
Linear Temporal Logic LTL: Basis for Admissible Rules
inferred← citeshttps://doi.org/10.1093/logcom/exr022openalex-snapshot
Writing out Unifiers in Linear Temporal Logic
inferred← citeshttps://doi.org/10.1109/icdmw.2010.47openalex-snapshot
Temporal Logic TL ^Z_ {DU} Modeling Local and Global Discovery with Logical Uncertainty
inferred← citeshttps://doi.org/10.1134/s0037446622040176openalex-snapshot
Multiagent Temporal Logics, Unification Problems, and Admissibilities
inferred← citeshttps://doi.org/10.1134/s0037446624010154openalex-snapshot
Admissibility and Unification in the Modal Logics Related to S4.2
inferred← citeshttps://doi.org/10.1215/00294527-3838972openalex-snapshot
The Admissible Rules of BD2 and GSc
inferred← citeshttps://doi.org/10.1504/ijaip.2010.030535openalex-snapshot
Modelling of Chance Discovery in variations of Linear Temporal Logic implementing agents' interaction
inferred← citeshttps://doi.org/10.17516/1997-1397-2016-9-2-149-157openalex-snapshot
Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:9)2011openalex-snapshot
Finitely generated free Heyting algebras via Birkhoff duality and coalgebra
inferred← citeshttps://doi.org/10.2178/jsl/1129642119openalex-snapshot
Logical consecutions in discrete linear temporal logic
inferred← citeshttps://doi.org/10.2307/2275521openalex-snapshot
Hereditarily structurally complete modal logics
inferred← citeshttps://doi.org/10.2307/2275844openalex-snapshot
The decidability of dependency in intuitionistic propositional logic
inferred← citeshttps://doi.org/10.2307/420957openalex-snapshot
1995–1996 Winter Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/421198openalex-snapshot
1995 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.3166/jancl.17.383-396openalex-snapshot
Logics with the universal modality and admissible consecutions
inferred← citeshttps://doi.org/10.4018/978-1-4666-0158-1.ch003openalex-snapshot
Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents
inferred← citeshttps://doi.org/10.4018/jiit.2010100903openalex-snapshot
Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents
inferred← citeshttps://doi.org/10.48550/arxiv.1406.2783openalex-snapshot
Linear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility
inferred← citeshttps://doi.org/10.48550/arxiv.1406.5495openalex-snapshot
Knowledge Representation in Agent's Logic with Uncertainty and Agent's Interaction
inferred← citeshttps://doi.org/10.48550/arxiv.1701.05138openalex-snapshot
Rejecting inadmissible rules in reduced normal forms in S4
inferred← citeshttps://doi.org/10.5281/zenodo.209742openalex-snapshot
FIGURES 29–34 in A revision of the spider genus Echinax Deeleman-Reinhold, 2001 (Araneae: Corinnidae) in the Afrotropical Region
inferred← citeshttps://doi.org/10.5555/1366742.1366761openalex-snapshot
Decidability w.r.t. Logical Consecutions of Linear Temporal Logic Extended by Since and Previous
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.