Results 1 to 10 of about 506,813 (163)
Game semantics for first-order logic [PDF]
Logical Methods in Computer Science, 2010 We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results.
Olivier Laurent
doaj +6 more sources
Bisimulation in Inquisitive Modal Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are ...
Ivano Ciardelli, Martin Otto
doaj +3 more sources
Systematic Verification of the Modal Logic Cube in Isabelle/HOL [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without restriction to the
Christoph Benzmüller +2 more
doaj +6 more sources
A herbrandized functional interpretation of classical first-order logic [PDF]
Archive for Mathematical Logic, 2017 We introduce a new typed combinatory calculus with a type constructor that, to each type σ, associates the star type σ^∗ of the nonempty finite subsets of elements of type σ.
Ferreira, Fernando, Ferreira, Gilda
core +3 more sources
Classical Proofs as Parallel Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We introduce a first proofs-as-parallel-programs correspondence for classical logic. We define a parallel and more powerful extension of the simply typed lambda calculus corresponding to an analytic natural deduction based on the excluded middle law. The
Federico Aschieri +2 more
doaj +5 more sources
Herbrand-Confluence for Cut Elimination in Classical First Order Logic [PDF]
, 2012 We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing.
Hetzl, Stefan
core +4 more sources
On Presburger arithmetic extended with non-unary counting quantifiers [PDF]
Logical Methods in Computer Science, 2023 We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are given as terms ...
Peter Habermehl, Dietrich Kuske
doaj +1 more source
First-Order Classical Modal Logic [PDF]
Studia Logica, 2006 This paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic.
Arló-Costa, Horacio, Pacuit, Eric
openaire +1 more source
A Paradox for the Existence Predicate
Bulletin of the Section of Logic, 2022 In this paper, a paradox is shown to arise in the context of classical logic from prima facie highly plausible assumptions for the existence predicate as applied to definite descriptions.
Uwe Meixner
doaj +1 more source
Combining First-Order Classical and Intuitionistic Logic
Electronic Proceedings in Theoretical Computer Science, 2022 In Proceedings NCL 2022, arXiv:2204 ...
Toyooka, Masanobu, Sano, Katsuhiko
openaire +2 more sources