Results 11 to 20 of about 2,358,795 (346)

Prefinitely axiomatizable modal and intermediate logics [PDF]

open access: greenMathematical Logic Quarterly, 1993
AbstractA logic Λ bounds a property P if all proper extensions of Λ have P while Λ itself does not. We construct logics bounding finite axiomatizability and logics bounding finite model property in the lattice of intermediate logics and in the lattice of normal extensions of K4.3. MSC: 03B45, 03B55.
Marcus Kracht
openalex   +6 more sources

Intermediate logics in the setting of team semantics

open access: green, 2022
Several authors have recently defined intuitionistic logic based on team semantics (tIPC). In this paper we provide two alternative approaches to intermediate logics in the team semantics setting. We do this by modifying tIPC with axioms written with two different versions of disjunction in the logic, a local one and global one.
Nick Bezhanishvili, Fan Yang
openalex   +5 more sources

Topologies for intermediate logics [PDF]

open access: yesMathematical Logic Quarterly, 2014
We investigate the problem of characterizing the classes of Grothendieck toposes whose internal logic satisfies a given assertion in the theory of Heyting algebras, and introduce natural analogues of the double negation and De Morgan topologies on an elementary topos for a wide class of intermediate logics.
Caramello, Olivia
openaire   +5 more sources

Reflexive Intermediate Propositional Logics [PDF]

open access: bronzeNotre Dame Journal of Formal Logic, 2006
Which intermediate propositional logics can prove their own completeness? I call a logic reflexive if a second-order metatheory of arithmetic created from the logic is sufficient to prove the completeness of the original logic. Given the collection of intermediate propositional logics, I prove that the reflexive logics are exactly those that are at ...
Nathan C. Carter
openalex   +3 more sources

EPSILON THEOREMS IN INTERMEDIATE LOGICS [PDF]

open access: hybridThe Journal of Symbolic Logic, 2022
AbstractAny intermediate propositional logic (i.e., a logic including intuitionistic logic and contained in classical logic) can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus.
Matthias Baaz, Richard Zach
openalex   +4 more sources

Kripke Models and Intermediate Logics

open access: bronzePublications of the Research Institute for Mathematical Sciences, 1970
In [10], Kripke gave a definition of the semantics of the intuitionistic logic. Fitting [2] showed that Kripke's models are equivalent to algebraic models (i.e., pseudo-Boolean models) in a certain sense. As a corollary of this result, we can show that any partially ordered set is regarded as a (characteristic) model of a intermediate logic ^ We shall ...
Hiroakira Ono
openalex   +4 more sources

Almost Linear Büchi Automata [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2009
We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Buechi automata (BA) called Almost linear Buechi automata (ALBA).
Tomáš Babiak   +2 more
doaj   +4 more sources

Intermediate logics and factors of the Medvedev lattice

open access: greenAnnals of Pure and Applied Logic, 2006
We investigate the initial segments of the Medvedev lattice as Brouwer algebras, and study the propositional logics connected to them.
Andrea Sorbi, Sebastiaan A. Terwijn
openalex   +9 more sources

A continuum of incomplete intermediate logics [PDF]

open access: green, 2018
This paper generalizes the 1977 paper of V.B. Shehtman, which constructed the first Kripke incomplete intermediate logic, by presenting a continuum of such logics. This version fixes an error in my simplified proof of incompleteness of Shehtman's original logic.
Tadeusz Litak
openalex   +5 more sources

Characterization of strongly equivalent logic programs in intermediate logics [PDF]

open access: greenTheory and Practice of Logic Programming, 2003
The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be verified in 3-valued Gödel logic, G3, the strongest non-classical intermediate propositional logic (Lifschitz et al., 2001).
D.H.J. de Jongh, Lex Hendriks
openalex   +4 more sources

Home - About - Disclaimer - Privacy