On the public citation graph
A criterion for admissibility of rules in the model system S4 and the intuitionistic logic
0 signed · 100 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/bf01669113openalex-snapshot
Admissible rules for pretable modal logics
inferredcites →https://doi.org/10.1007/bf01979701openalex-snapshot
Decidability of the admissibility problem in layer-finite logics
inferredcites →https://doi.org/10.1070/sm1977v031n02abeh002303openalex-snapshot
ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
inferredcites →https://doi.org/10.2307/2271891openalex-snapshot
One hundred and two problems in mathematical logic
inferredcites →https://doi.org/10.2307/2964334openalex-snapshot
Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
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.19990450409openalex-snapshot
On Finite Model Property for Admissible Rules
inferred← citeshttps://doi.org/10.1007/0-387-31072-x_2openalex-snapshot
Problems in the Logic of Provability
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-68934-5_16openalex-snapshot
Investigating Definability in Propositional Logic via Sheaves on Grothendieck Topologies
inferred← citeshttps://doi.org/10.1007/978-3-319-07650-8_10openalex-snapshot
Multi-agent Non-linear Temporal Logic with Embodied Agent Describing Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_6openalex-snapshot
Multiple Conclusion Rules in Logics with the Disjunction Property
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-540-74827-4_119openalex-snapshot
Logic of Discovery in Uncertain Situations– Deciding Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-85565-1_88openalex-snapshot
Logic of Discovery and Knowledge: Decision Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-85567-5_27openalex-snapshot
Logic of Plausibility for Discovery in Multi-agent Environment Deciding Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-04595-0_5openalex-snapshot
Describing Evolutions of Multi-Agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-13526-2_8openalex-snapshot
Logical Analysis of Multi-agent Kripke Structures
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-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-35722-0_15openalex-snapshot
A Note on Extensions: Admissible Rules via Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-38610-7_35openalex-snapshot
Multi-Agent Temporary Logic $ TS4^U_{K_n}$ Based at Non-linear Time and Imitating Uncertainty via Agents’ Interaction
inferred← citeshttps://doi.org/10.1007/978-3-662-46906-4_4openalex-snapshot
Admissibility and Unifiability in Contact Logics
inferred← citeshttps://doi.org/10.1007/978-3-662-58771-3_1openalex-snapshot
Unification in Modal Logic
inferred← citeshttps://doi.org/10.1007/bf00972777openalex-snapshot
Solvability of logical equations in the modal system Grz and intuitionistic logic
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/bf01156607openalex-snapshot
Semantic admissibility criteria for deduction rules in S4 and Int
inferred← citeshttps://doi.org/10.1007/bf01978706openalex-snapshot
Bases of admissible rules of the logics S4 and Int
inferred← citeshttps://doi.org/10.1007/bf01978885openalex-snapshot
Equations in free topoboolean algebra
inferred← citeshttps://doi.org/10.1007/bf02259929openalex-snapshot
The decidability of admissibility problems for modal logics S4.2 and S4.2Grz and superintuitionistic logic KC
inferred← citeshttps://doi.org/10.1007/bf02260875openalex-snapshot
Bases of admissible rules in modal logics S4.2 and S4.2Grz
inferred← citeshttps://doi.org/10.1007/bf02681666openalex-snapshot
Independent bases for admissible rules in pretable logics
inferred← citeshttps://doi.org/10.1007/s00153-006-0320-8openalex-snapshot
On the rules of intermediate logics
inferred← citeshttps://doi.org/10.1007/s00153-014-0388-5openalex-snapshot
Admissibility and refutation: some characterisations of intermediate logics
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-005-0024-xopenalex-snapshot
Decidability of the Admissibility Problem for Inference Rules in Some S5t-Logics
inferred← citeshttps://doi.org/10.1007/s10469-024-09733-6openalex-snapshot
An Explicit Basis for WCP-Globally Admissible Inference Rules
inferred← citeshttps://doi.org/10.1007/s11225-011-9354-yopenalex-snapshot
Best Unifiers in Transitive Modal Logics
inferred← citeshttps://doi.org/10.1007/s11225-016-9672-1openalex-snapshot
Finite Frames Fail: How Infinity Works Its Way into the Semantics of Admissibility
inferred← citeshttps://doi.org/10.1007/s11225-019-09883-0openalex-snapshot
About the Unification Type of Modal Logics Between $$\mathbf {KB}$$ and $$\mathbf {KTB}$$
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.1007/s11787-017-0180-5openalex-snapshot
Admissibility in Positive Logics
inferred← citeshttps://doi.org/10.1007/s11787-021-00287-0openalex-snapshot
Unification in Pretabular Extensions of S4
inferred← citeshttps://doi.org/10.1016/0168-0072(90)90055-7openalex-snapshot
Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
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.apal.2013.09.003openalex-snapshot
On unification and admissible rules in Gabbay–de Jongh logics
inferred← citeshttps://doi.org/10.1016/j.apal.2015.04.004openalex-snapshot
Rules with parameters in modal logic I
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.ins.2008.12.008openalex-snapshot
Logic of knowledge and discovery via interacting agents – Decision algorithm for true and satisfiable statements☆
inferred← citeshttps://doi.org/10.1016/j.jpaa.2015.02.015openalex-snapshot
Admissibility via natural dualities
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/s0049-237x(08)70041-7openalex-snapshot
Problems of Admissibility and Substitution, Logical Equations and Restricted Theories of free Algebras
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/s0960129500000165openalex-snapshot
Admissible and derivable rules in intuitionistic logic
inferred← citeshttps://doi.org/10.1017/s1755020316000241openalex-snapshot
PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS
inferred← citeshttps://doi.org/10.1023/a:1005244015730openalex-snapshot
On Self-Admissible Quasi-Characterizing Inference Rules
inferred← citeshttps://doi.org/10.1023/a:1008237600846openalex-snapshot
Speaking about Transitive Frames in Propositional Languages
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.1023/a:1024768003426openalex-snapshot
A Criterion for Admissibility of Inference Rules in Some Class of S4-Logics Without the Branching Property
inferred← citeshttps://doi.org/10.1070/im1991v037n03abeh002165openalex-snapshot
CRITERIA FOR ADMISSIBILITY OF RULES OF INFERENCE WITH PARAMETERS IN THE INTUITIONISTIC PROPOSITIONAL CALCULUS
inferred← citeshttps://doi.org/10.1093/jigpal/jzab036openalex-snapshot
Unification types in Euclidean modal logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzad021openalex-snapshot
Undecidability of admissibility in the product of two Alt logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzq008openalex-snapshot
Unification in modal and description logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzr028openalex-snapshot
Projective unification in modal logic
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/jzy078openalex-snapshot
Remarks about the unification type of several non-symmetric non-transitive modal logics
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/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.1093/logcom/ext031openalex-snapshot
An Avron rule for fragments of R-mingle
inferred← citeshttps://doi.org/10.1134/s003744661503009xopenalex-snapshot
Admissible inference rules in the linear logic of knowledge and time LTK r with intransitive time relation
inferred← citeshttps://doi.org/10.1134/s0037446624010142openalex-snapshot
Admissible Inference Rules of Modal WCP-Logics
inferred← citeshttps://doi.org/10.12775/llp.2008.003openalex-snapshot
A mind of a non-countable set of ideas
inferred← citeshttps://doi.org/10.12775/llp.2008.009openalex-snapshot
Discrete linear temporal logic with current time point clusters, deciding algorithms
inferred← citeshttps://doi.org/10.1515/dma-2023-0011openalex-snapshot
Explicit basis for admissible rules in K -saturated tabular logics
inferred← citeshttps://doi.org/10.2178/jsl/1129642119openalex-snapshot
Logical consecutions in discrete linear temporal logic
inferred← citeshttps://doi.org/10.2307/2275439openalex-snapshot
Rules of inference with parameters for intuitionistic logic
inferred← citeshttps://doi.org/10.2307/2275521openalex-snapshot
Hereditarily structurally complete modal logics
inferred← citeshttps://doi.org/10.2307/420948openalex-snapshot
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.3233/idt-2009-0052openalex-snapshot
Logic of discovery and knowledge. Decision algorithm
inferred← citeshttps://doi.org/10.33540/1486openalex-snapshot
Uniform Interpolation and Admissible Rules
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.4213/im9592openalex-snapshot
On the unification problem for $\mathrm{GLP}$
inferred← citeshttps://doi.org/10.4213/im9592eopenalex-snapshot
On the unification problem for $\mathrm{GLP}$
inferred← citeshttps://doi.org/10.48550/arxiv.1902.03770openalex-snapshot
About the unification type of simple symmetric modal logics
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.