Results 261 to 270 of about 455,476 (286)
Some of the next articles are maybe not open access.
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
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
On finite approximability of ?-intermediate logics
Studia Logica, 1982The 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
On Extensions of Intermediate Logics by Strong Negation
Journal of Philosophical Logic, 1998The structure \({\mathcal E} {\mathbf N}\) of extensions of Nelson logic \(N\) (intuitionistic logic with strong negation) and its correlations with the structure \({\mathcal E} {\mathbf {Int}}\) of intermediate logics is studied. The mapping from \(\Lambda\) to \(n( \Lambda) = N + \Lambda \) is an embedding of the complete lattice \({\mathcal E ...
openaire +2 more sources
Frame Based Formulas for Intermediate Logics
Studia Logica, 2008In 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
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
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
On logics intermediate between intuitionistic and classical predicate logic
Journal of Symbolic Logic, 1959In [1] and [2] I investigated logics intermediate between intuitionistic and classical propositional logic. In the present paper I shall study inclusion and non-inclusion between certain intermediate predicate logics. All the logics considered result from intuitionistic predicate logic by addition of classically valid axiom schemes.
openaire +1 more source
The theory of intermediate quantifiers in fuzzy natural logic revisited and the model of “Many”
Fuzzy Sets and Systems, 2020Petra Murinova, Vilém Novak
exaly
Graded Cube of Opposition with Intermediate Quantifiers in Fuzzy Natural Logic
Communications in Computer and Information Science, 2020Petra Murinova, Vilém Novak
exaly
Syllogisms and 5-Square of Opposition with Intermediate Quantifiers in Fuzzy Natural Logic
Logica Universalis, 2016Petra Murinova, Vilém Novak
exaly