Results 251 to 260 of about 455,476 (286)

Possibilistic intermediate logic

International Journal of Advanced Intelligence Paradigms, 2012
We define what we call 'possibilistic intermediate logic (PIL)'; we present results analogous to those of the well-known intermediate logic, such as a deduction theorem, a generalised version of the deduction theorem, a cut rule, a weak version of a refutation theorem, a substitution theorem and Glivenko's theorem.
Oscar Hernán Estrada-Estrada, José R. Arrazola Ramírez, Mauricio Javier Osorio Galindo   +2 more
exaly   +2 more sources

On the rules of intermediate logics

Archive for Mathematical Logic, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rosalie Iemhoff
exaly   +3 more sources

Intermediate logics with the same disjunctionless fragment as intuitionistic logic

Studia Logica, 1986
An intermediate logic M is any consistent propositional logic containing intuitionistic logic I and closed under substitution and modus ponens. The author defines a sequence of formulae J as follows: start with \(\neg p\vee \neg \neg p\) and at any stage use the next sentential variable q and the formula A of the previous stage to form (q\(\to A)\vee (\
exaly   +3 more sources

Omitting Types in an Intermediate Logic

Studia Logica, 2011
The authors prove an omitting-types theorem and one direction of the Ryll-Nardzewski theorem, from classical model theory, for a special intermediate logic, called semi-classical logic (SLC). The semi-classical logic is the logic of the class of linear constant-domain Kripke models with an extra constraint, i.e., every node of the model is identified ...
Seyed Mohammad Bagheri, Massoud Pourmahdian   +1 more
openaire   +1 more source

On intermediate propositional logics

Journal of Symbolic Logic, 1959
By intermediate prepositional logics we mean prepositional logics between the intuitionistic and classical logics.K. Gödel [1] proved that there is a set of intermediate prepositional logics which possesses the order type ω. The method enables us to define intermediate logics in terms of axioms and rules of inference.
openaire   +1 more source

Proof analysis in intermediate logics

Archive for Mathematical Logic, 2011
The authors continue the investigation of cut-free systems for superintuitionistic logics inspired by translating a formula \(F\) into a formula saying ``\(F\) is true in all Kripke models'' (of a given logic). The approach works smoothly when the condition on the accessibility relation in Kripke models is expressed by a geometric formula \(\forall\bar{
Dyckhoff R., Negri S.
openaire   +1 more source

On the Independent Axiomatizability of Modal and Intermediate Logics

Journal of Logic and Computation, 1995
The paper solves in the negative the problem of the existence of independent axiomatizations for modal and intermediate propositional logics (formulated by A. Tsytkin in 1986). The main idea is to use the following necessary condition: if a logic \(L\) is independently axiomatizable then every interval of logics \([L_1, L]\) with \(L_1\) finitely ...
Alexander V. Chagrov, Michael Zakharyaschev   +1 more
openaire   +2 more sources

Hypersequents, logical consequence and intermediate logics for concurrency

Annals of Mathematics and Artificial Intelligence, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Applications of trees to intermediate logics

Journal of Symbolic Logic, 1972
We investigate extensions of Heyting's predicate calculus (HPC). We relate geometric properties of the trees of Kripke models (see [2]) with schemas of HPC and thus obtain completeness theorems for several intermediate logics defined by schemas. Our main results are:(a) ∼(∀x ∼ ∼ϕ(x) Λ ∼∀xϕ(x)) is characterized by all Kripke models with trees T with the
openaire   +1 more source