Results 1 to 10 of about 150,676 (217)
Cut-Free Gentzen Sequent Calculi for Tense Logics
Axioms, 2023 The cut-free single-succedent Gentzen sequent calculus GKt for the minimal tense logic Kt is introduced. This sequent calculus satisfies the displaying property.
Zhe Lin, Minghui Ma
doaj +1 more source
Isomorphism between Sudoku and Proof Systems and Its Application in Sudoku Solving
Proceedings, 2022 (1) Introduction: While automatic Sudoku solvers are a well-known area of study in formal sciences, there has been little to no progress when it comes to describing the proving process as analogous to Sudoku solving. (2) Materials and Methods: This paper
Jakub Dakowski
doaj +1 more source
A modular construction of type theories [PDF]
Logical Methods in Computer Science, 2023 The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a sub-theory of U
Frédéric Blanqui +4 more
doaj +1 more source
Cut Elimination for Extended Sequent Calculi
Bulletin of the Section of Logic, 2023 We present a syntactical cut-elimination proof for an extended sequent calculus covering the classical modal logics in the \(\mathsf{K}\), \(\mathsf{D}\), \(\mathsf{T}\), \(\mathsf{K4}\), \(\mathsf{D4}\) and \(\mathsf{S4}\) spectrum.
Simone Martini +2 more
doaj +1 more source
Proof Theory of Riesz Spaces and Modal Riesz Spaces [PDF]
Logical Methods in Computer Science, 2022 We design hypersequent calculus proof systems for the theories of Riesz spaces and modal Riesz spaces and prove the key theorems: soundness, completeness and cut elimination.
Christophe Lucas, Matteo Mio
doaj +1 more source
Labelled Natural Deduction for Public Announcement Logic with Common Knowledge
Mathematics, 2020 Public announcement logic is a logic that studies epistemic updates. In this paper, we propose a sound and complete labelled natural deduction system for public announcement logic with the common knowledge operator (PAC). The completeness of the proposed
Muhammad Farhan Mohd Nasir +2 more
doaj +1 more source
Model Theory and Proof Theory of Coalgebraic Predicate Logic [PDF]
Logical Methods in Computer Science, 2018 We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras.
Tadeusz Litak +3 more
doaj +1 more source
CLEI Electronic Journal, 2023 This work presents an interactive proof assistant, based on Dijkstra-Scholten logic, aimed at teaching logic and discrete mathematics in higher education.
Federico Flaviani, Walter Carballosa
doaj +1 more source
Categorical Proof Theory of Co-Intuitionistic Linear Logic [PDF]
Logical Methods in Computer Science, 2014 To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category Set, where coproducts are disjoint unions ...
Gianluigi Bellin
doaj +1 more source
Classical BI: Its Semantics and Proof Theory [PDF]
Logical Methods in Computer Science, 2010 We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI.
James Brotherston, Cristiano Calcagno
doaj +1 more source