Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
Kripke completeness
Description:
A property of a formal logic whereby its theorems coincide with the formulas valid across a class of Kripke frames.
Primary topic:
Logic, Reasoning, and Knowledge (54%)
Related topics:
Logic, Reasoning, and Knowledge (54%),
Advanced Algebra and Logic (42%)
OpenAlex ID:
keywords/kripke-completeness
Admissibility of Logical Inference Rules
1997
·
Studies in logic and the foundations of mathematics
·
226
9 First-order modal logic
2007
·
Torben Braüner
, Silvio Ghilardi
·
Studies in logic and practical reasoning
·
121
PDL with data constants
1985
·
Solomon Passy
, Tinko Tinchev
·
Information Processing Letters
·
70
Products of ‘transitive” modal logics
2005
·
D. Gabelaia
, A. Kurucz
, et al.
·
Journal of Symbolic Logic
·
48
The structure of lattices of subframe logics
1997
·
Frank Wolter
·
Annals of Pure and Applied Logic
·
47
PDF
Calibrating Provability Logic: From Modal Logic to Re ection Calculus
2012
·
D Beklemishev Lev
·
Advances in Modal Logic
·
36
A Sahlqvist Theorem for Relevant Modal Logics
2003
·
Takahiro Seki
·
Studia Logica
·
36
Completeness and decidability of tense logics closely related to logics above K4
1997
·
Frank Wolter
·
Journal of Symbolic Logic
·
33
Kripke Completeness of Strictly Positive Modal Logics Over Meet-semilattices With Operators
2019
·
STANISLAV KIKOT
, AGI KURUCZ
, et al.
·
Journal of Symbolic Logic
·
27
Kripke Completeness of First-Order Constructive Logics with Strong Negation
2003
·
I. Hasuo
·
Logic Journal of IGPL
·
26
Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas
1993
·
Tatsuya Shimura
·
Studia Logica
·
22
Non-deterministic semantics for dynamic topological logic
2008
·
David Fernández
·
Annals of Pure and Applied Logic
·
21
PDF
On Notions of Completeness Weaker than Kripke Completeness.
2004
·
Tadeusz Litak
·
Advances in Modal Logic
·
18
Arithmetical Completeness Theorem for Modal Logic $$\mathsf{K}$$
2017
·
Taishi Kurahashi
·
Studia Logica
·
17
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
2001
·
Hiroshi Nakano
·
Lecture notes in computer science
·
17
Kripke Completeness of Infinitary Predicate Multimodal Logics
1999
·
Yoshihito Tanaka
·
Notre Dame Journal of Formal Logic
·
17
PDF
A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames.
2018
·
Mikhail Rybakov
, Dmitry Shkatov
·
Advances in Modal Logic
·
16
A semantical analysis of cut-free calculi for modal logics
2018
·
Mitio Takano
·
Reports on Mathematical Logic
·
15
PDF
Hybrid Counterfactual Logics: David Lewis Meets Arthur Prior Again
2009
·
Katsuhiko Sano
·
Journal of Logic Language and Information
·
15
Modal Companions of Superintuitionistic Logics: Syntax, Semantics, and Preservation Theorems
1991
·
M V Zakhar'yashchev
·
Mathematics of the USSR-Sbornik
·
14
On Modal Logics of Model-Theoretic Relations
2019
·
Denis I. Saveliev
, Ilya B. Shapirovsky
·
Studia Logica
·
13
PDF
A Map of Common Knowledge Logics
2002
·
Mamoru Kaneko
, Takashi Nagashima
, et al.
·
Studia Logica
·
13
Recursive enumerability and elementary frame definability in predicate modal logic
2019
·
Mikhail Rybakov
, Dmitry Shkatov
·
Journal of Logic and Computation
·
12
PDF
An Embedding-based Completeness Proof for Nelson's Paraconsistent Logic
2010
·
Norihiro Kamide
·
12
On sequent calculi for intuitionistic propositional logic
2006
·
Vítězslav Švejdar
·
Czech digital mathematics library
·
11
PDF
Show more works
View as search
Works count:
111
Citation count:
1,106
Year
Topic
Type