Results 261 to 270 of about 38,385 (299)

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, José Ramón Enrique Arrazola Ramírez, Mauricio Javier Osorio Galindo   +2 more
openaire   +1 more source

Intermediate Logic

1997
Abstract Intermediate Logic is an ideal text for anyone who has taken a first course in logic and is progressing to further study. It examines logical theory, rather than the applications of logic, and does not assume any specific technological grounding.
openaire   +1 more source

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 ...
Bagheri, Seyed-Mohammad, Pourmahdian, Massoud   +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

Three Intermediate Logics

1981
We saw in previous chapters the following properties of h: (1) h is complete for the class of all finite trees (2) h + is complete for the class of all finite n-ary trees, for any n≥2. (3) h is complete for the infinite full binary tree.
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

Frame Based Formulas for Intermediate Logics

Studia Logica, 2008
In the study of propositional logics, particularly of intermediate logics and normal modal logics, the so-called Jankov-de Jongh formulas defined by finite frames have been applied as a powerful tool to many important results in several topics such as axiomatizability, finite model property, splitting, construction of continuum many logics, and so on ...
openaire   +2 more sources

On finite approximability of ?-intermediate logics

Studia Logica, 1982
The aim of this note is to show (Theorem 1.6) that in each of the cases: ψ= {→, ∨ }, or {→, ∨, ∧ }, or {→, ∨, ℸ } there are uncountably many ψ-intermediate logics which are not finitely approximable. This result together with the results known in literature allow us to conclude (Theorem 2.2) that for each ψ: either all ψ-intermediate logics are ...
openaire   +2 more sources