On the public citation graph

On the predicate logics of finite Kripke frames

https://doi.org/10.1007/bf01058533
0 signed · 25 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.1002/malq.19890350507openalex-snapshot
Axiomatization of the First‐Order Intermediate Logics of Bounded Kripkean Heights I
inferredcites →https://doi.org/10.1002/malq.19910370202openalex-snapshot
Axiomatization of the First‐Order Intermediate Logics of Bounded Kripkean Heights II
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/bf00370118openalex-snapshot
Completeness theorem for dummett's LC quantified and some of its extensions
inferredcites →https://doi.org/10.1007/bf00671568openalex-snapshot
On finite linear intermediate predicate logics
inferredcites →https://doi.org/10.1007/bf01053062openalex-snapshot
Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas
inferredcites →https://doi.org/10.1007/bf01620621openalex-snapshot
Presheaf semantics and independence results for some non-classical first-order logics
inferredcites →https://doi.org/10.1007/bf01630811openalex-snapshot
Directed frames
inferredcites →https://doi.org/10.2307/2272344openalex-snapshot
A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property
inferredcites →https://doi.org/10.2307/2274697openalex-snapshot
Incompleteness results in Kripke semantics

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_26openalex-snapshot
Mathematical Logic in the Former Soviet Union: Brief History and Current Trends
inferred← citeshttps://doi.org/10.1007/s11225-005-3706-4openalex-snapshot
On the Predicate Logic of Linear Kripke Frames and some of its Extensions
inferred← citeshttps://doi.org/10.1007/s11225-012-9382-2openalex-snapshot
Kripke Sheaf Completeness of some Superintuitionistic Predicate Logics with a Weakened Constant Domains Principle
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70736-0openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80012-7openalex-snapshot
9 First-order modal logic
inferred← citeshttps://doi.org/10.1023/a:1005088429206openalex-snapshot
Not Every "Tabular" Predicate Logic is Finitely Axiomatizable
inferred← citeshttps://doi.org/10.1023/b:stud.0000039028.22017.4fopenalex-snapshot
On Intermediate Predicate Logics of some Finite Kripke Frames, I. Levelwise Uniform Trees
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/exaa041openalex-snapshot
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
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/exab030openalex-snapshot
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
inferred← citeshttps://doi.org/10.1093/logcom/exz028openalex-snapshot
Recursive enumerability and elementary frame definability in predicate modal logic
inferred← citeshttps://doi.org/10.21146/2074-1472-2015-21-1-86-99openalex-snapshot
Kripke Incompleteness of First-order Calculi with Temporal Modalities of CTL and Near Logics
inferred← citeshttps://doi.org/10.2178/jsl/1120224722openalex-snapshot
The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable
inferred← citeshttps://doi.org/10.26456/vtpmk511openalex-snapshot
Axiomatizability of non-normal and quasi-normal modal predicate logics of first-order definable classes of Kripke frames
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.