Results 11 to 20 of about 7,429,852 (332)
, 2018 Proof theory is a branch of mathematical logic founded by David Hilbert around 1920 to pursue Hilbert’s programme. The problems addressed by the programme had already been formulated, in some sense, at the turn of the century, for example, in Hilbert’s famous address to the First International Congress of Mathematicians in Paris.
Wilfried Sieg (5372201)
core +5 more sources
Annals of Pure and Applied Logic, 2002 This paper gives a purely categorical view of proof theory. The author presents detailed categorical approaches to the Dialectica interpretation and the Diller-Nahm interpretation. The last two sections deal with the problem of coding classical proofs and classical proof theory from a categorical point of view.
J.M.E. Hyland, J. M. E. Hyland
openaire +2 more sources
A Graphical Proof Theory of Logical Time
International Conference on Formal Structures for Computation and Deduction, 2022 Logical time is a partial order over events in distributed systems, constraining which events precede others. Special interest has been given to series-parallel orders since they correspond to formulas constructed via the two operations for “series” and “
Matteo Acclavio +3 more
semanticscholar +1 more source
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
Classical and Fuzzy Two-Layered Modal Logics for Uncertainty: Translations and Proof-Theory
International Journal of Computational Intelligence Systems, 2020 This paper is a contribution to the study of two distinct kinds of logics for modelling uncertainty. Both approaches use logics with a two-layered modal syntax, but while one employs classical logic on both levels and infinitely-many multimodal operators,
P. Baldi, P. Cintula, C. Noguera
semanticscholar +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