Results 21 to 30 of about 506,932 (281)
On the Concept of a Notational Variant [PDF]
, 2017 In the study of modal and nonclassical logics, translations have frequently been employed as a way of measuring the inferential capabilities of a logic.
C Caleiro +14 more
core +1 more source
Typed realizability for first-order classical analysis [PDF]
Logical Methods in Computer Science, 2015 We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus.
Valentin Blot
doaj +1 more source
The validity degree vectors of formulae in two-valued predicate logic [PDF]
International Journal of Computational Intelligence Systems, 2015 By means of infinite product of uniformly distributed probability spaces of cardinal , the concept of -validity degrees and validity degree vectors of formulae in two-valued predicate logic are introduced. It is proved that the validity degree vectors of
Xiaoyan Qin, Yang Xu, Yi Liu
doaj +1 more source
Education and Research Archive, 2020 The first sequent calculus, LK is the example after which many other calculi have been fashioned. We describe this calculus, prove its equivalence to the axiom system K, and provide a sound and complete interpretation too. A major part of Section 2.3 is a presentation of the proof of the cut theorem using triple induction.
openaire +3 more sources
Intuitionistic completeness for first order classical logic [PDF]
Journal of Symbolic Logic, 1999 AbstractIn the past sixty years or so, a real forest of intuitionistic models for classical theories has grown. In this paper we will compare intuitionistic models of first order classical theories according to relevant issues, like completeness (w.r.t.
openaire +3 more sources
Completeness for the Classical Antecedent Fragment of Inquisitive First-Order Logic [PDF]
Journal of Logic, Language and Information, 2021 AbstractInquisitive first order logic "Equation missing" is an extension of first order classical logic, introducing questions and studying the logical relations between questions and quantifiers. It is not known whether "Equation missing" is recursively axiomatizable, even though an axiomatization has been found for fragments of the logic (Ciardelli ...
openaire +3 more sources
Logical operators for ontological modeling [PDF]
, 2014 We show that logic has more to offer to ontologists than standard first order and modal operators. We first describe some operators of linear logic which we believe are particularly suitable for ontological modeling, and suggest how ...
Borgo, Stefano +2 more
core +1 more source
Philosophia Scientiæ, 2005 Hintikka and Sandu have developed IF logic as a genuine alternative to classical first-order logic : liberalizing dependence schemas between quantifiers, IF would carry out all the ideas already underlying classical logic.
Denis Bonnay
doaj +1 more source
Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]
Computer Science Journal of Moldova, 2015 The paper is about the notions of admissibility and compatibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules.
Alexander Lyaletski
doaj
MATEC Web of Conferences, 2018 Game-theoretical interpretation of logical semantics has been first suggested in 1950s. Although it is well know among professionals, it is often excluded from introductory courses in logic.
Glivická Jana
doaj +1 more source