On the public citation graph
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
0 signed · 82 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.1002/malq.19620080204openalex-snapshot
The Undecidability of Monadic Modal Quantification Theory
inferredcites →https://doi.org/10.1002/malq.19750210118openalex-snapshot
On languages with two variables
inferredcites →https://doi.org/10.1007/3-540-09526-8_17openalex-snapshot
Completeness problems in verification of programs and program schemes
inferredcites →https://doi.org/10.1007/978-1-4613-0609-2_9openalex-snapshot
Semantics of Non-Classical First Order Predicate Logics
inferredcites →https://doi.org/10.1007/978-3-030-02508-3_21openalex-snapshot
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables
inferredcites →https://doi.org/10.1007/978-3-642-59207-2openalex-snapshot
The Classical Decision Problem
inferredcites →https://doi.org/10.1007/978-3-662-07003-1openalex-snapshot
Elements of Finite Model Theory
inferredcites →https://doi.org/10.1007/978-94-009-6259-0_5openalex-snapshot
Quantification in Modal Logic
inferredcites →https://doi.org/10.1007/978-94-017-0454-0_3openalex-snapshot
Quantification in Modal Logic
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/bf00370376openalex-snapshot
Ordered sets R and Q as bases of Kripke models
inferredcites →https://doi.org/10.1007/bf01050635openalex-snapshot
A modal perspective on the computational complexity of attribute value grammar
inferredcites →https://doi.org/10.1007/bf01058533openalex-snapshot
On the predicate logics of finite Kripke frames
inferredcites →https://doi.org/10.1007/bf01448447openalex-snapshot
Beitr�ge zur Algebra der Logik, insbesondere zum Entscheidungsproblem
inferredcites →https://doi.org/10.1007/bf01457985openalex-snapshot
Beitr�ge zur Algebra der Logik, insbesondere zum Entscheidungsproblem
inferredcites →https://doi.org/10.1007/bf01458217openalex-snapshot
Über Möglichkeiten im Relativkalkül
inferredcites →https://doi.org/10.1007/bf02121259openalex-snapshot
On modal logic with an intuitionistic base
inferredcites →https://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
inferredcites →https://doi.org/10.1016/0004-3702(95)00018-aopenalex-snapshot
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
inferredcites →https://doi.org/10.1016/0168-0072(93)90210-5openalex-snapshot
Maximal Kripke-type semantics for modal and superintuitionistic predicate logics
inferredcites →https://doi.org/10.1016/0304-3975(86)90157-xopenalex-snapshot
Concerning the semantic consequence relation in first-order temporal logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90045-xopenalex-snapshot
Incompleteness of first-order temporal logic with until
inferredcites →https://doi.org/10.1016/0304-3975(89)90138-2openalex-snapshot
The power of temporal proofs
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50001-0openalex-snapshot
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
inferredcites →https://doi.org/10.1016/s0049-237x(03)x8001-5openalex-snapshot
Many-Dimensional Modal Logics - Theory and Applications
inferredcites →https://doi.org/10.1016/s0049-237x(09)x0001-7openalex-snapshot
Quantification in Nonclassical Logic - Volume 1
inferredcites →https://doi.org/10.1016/s0168-0072(00)00018-xopenalex-snapshot
Decidable fragments of first-order temporal logics
inferredcites →https://doi.org/10.1016/s1570-2464(07)80012-7openalex-snapshot
9 First-order modal logic
inferredcites →https://doi.org/10.1017/cbo9780511862359openalex-snapshot
Quantifiers, Propositions and Identity
inferredcites →https://doi.org/10.1017/s0022481200092574openalex-snapshot
Andrzej Mostowski. An example of a non-axiomatizable many valued logic. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 (1961), pp. 72–76.
inferredcites →https://doi.org/10.1023/a:1005271815356openalex-snapshot
First Order Common Knowledge Logics
inferredcites →https://doi.org/10.1038/scientificamerican06251859-349aopenalex-snapshot
The Past, the Present and the Future
inferredcites →https://doi.org/10.1080/11663081.1992.10510779openalex-snapshot
Decidability and incompleteness results for first-order temporal logics of linear time
inferredcites →https://doi.org/10.1090/memo/0066openalex-snapshot
The undecidability of the domino problem
inferredcites →https://doi.org/10.1090/memo/0604openalex-snapshot
Decision problems for equational theories of relation algebras
inferredcites →https://doi.org/10.1090/s0002-9947-1961-0139530-9openalex-snapshot
Decision problems of finite automata design and related arithmetics
inferredcites →https://doi.org/10.1093/acprof:oso/9780198243113.001.0001openalex-snapshot
Past, Present and Future
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1093/jigpal/6.1.73openalex-snapshot
Products of modal logics, part 1
inferredcites →https://doi.org/10.1093/jigpal/jzy014openalex-snapshot
Complexity and expressivity of propositional dynamic logics with finitely many variables
inferredcites →https://doi.org/10.1093/logcom/11.6.909openalex-snapshot
On the Products of Linear Modal Logics
inferredcites →https://doi.org/10.1093/logcom/9.2.197openalex-snapshot
Complexity of products of modal logics
inferredcites →https://doi.org/10.1093/logcom/exaa041openalex-snapshot
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
inferredcites →https://doi.org/10.1093/logcom/exaa060openalex-snapshot
Complexity of finite-variable fragments of products withK
inferredcites →https://doi.org/10.1093/logcom/exaa091openalex-snapshot
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
inferredcites →https://doi.org/10.1093/logcom/exp046openalex-snapshot
A Remark on Superintuitionistic Predicate Logics of Kripke Frames with Constant and with Nested Domains
inferredcites →https://doi.org/10.1093/logcom/exz028openalex-snapshot
Recursive enumerability and elementary frame definability in predicate modal logic
inferredcites →https://doi.org/10.1145/3351108.3351128openalex-snapshot
Trakhtenbrot theorem for classical languages with three individual variables
inferredcites →https://doi.org/10.1145/4904.4993openalex-snapshot
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
inferredcites →https://doi.org/10.1305/ndjfl/1093634657openalex-snapshot
Quantified modal logics of positive rational numbers and some related systems.
inferredcites →https://doi.org/10.2178/bsl/1122038996openalex-snapshot
Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
inferredcites →https://doi.org/10.2178/jsl/1120224722openalex-snapshot
The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable
inferredcites →https://doi.org/10.2307/1993511openalex-snapshot
Decision Problems of Finite Automata Design and Related Arithmetics
inferredcites →https://doi.org/10.2307/2274406openalex-snapshot
Johan van Benthem. Modal logic and classical logic. Indices, no. 3. Bibliopolis, Naples 1985 (©1983), also distributed by Humanities Press, Atlantic Highlands, N.J., 234 pp.
inferredcites →https://doi.org/10.2307/2274475openalex-snapshot
Finite Kripke models and predicate logics of provability
inferredcites →https://doi.org/10.2307/2275098openalex-snapshot
Undecidability of modal and intermediate first-order logics with two individual variables
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2695115openalex-snapshot
Decidable fragments of first-order modal logics
inferredcites →https://doi.org/10.2307/421196openalex-snapshot
On the Decision Problem for Two-Variable First-Order Logic
inferredcites →https://doi.org/10.2977/prims/1195189604openalex-snapshot
On Some Intuitionistic Modal Logics
inferredcites →https://doi.org/10.4324/9780203290644openalex-snapshot
A NEW INTRODUCTION TO MODAL 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/s11225-023-10093-yopenalex-snapshot
Variations on the Kripke Trick
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105062openalex-snapshot
Are bundles good deals for first-order modal logic?
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.056openalex-snapshot
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
inferred← citeshttps://doi.org/10.1093/jigpal/jzab018openalex-snapshot
Undecidability of the Logic of Partial Quasiary Predicates
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/logcom/exaa060openalex-snapshot
Complexity of finite-variable fragments of products withK
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/exab080openalex-snapshot
Complexity of finite-variable fragments of products with non-transitive modal logics
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/exag026openalex-snapshot
Non-axiomatizability of modal predicate logics of Dedekind-complete linear orders with constant domains
inferred← citeshttps://doi.org/10.1134/s1064562422700053openalex-snapshot
Computational Complexity of Theories of a Binary Predicate with a Small Number of Variables
inferred← citeshttps://doi.org/10.21146/2074-1472-2021-27-2-93-120openalex-snapshot
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
inferred← citeshttps://doi.org/10.21146/2074-1472-2023-29-1-114-146openalex-snapshot
Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
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.