Results 11 to 20 of about 2,682,535 (254)
Cut elimination for knowledge logic with interaction
Lietuvos Matematikos Rinkinys, 2021 In the article the multimodal logic Tn with central agent interaction axiom is analysed. The Hilbert type calculi is presented, then Gentzen type calculi with cut is derived and the proof of cutelimination theorem is outlined.
Julius Andrikonis +1 more
doaj +3 more sources
A new calculus for intuitionistic Strong Löb logic: strong termination and cut-elimination, formalised [PDF]
International Conference on Theorem Proving with Analytic Tableaux and Related Methods, 2023 We provide a new sequent calculus that enjoys syntactic cut-elimination and strongly terminating backward proof search for the intuitionistic Strong L\"ob logic $\sf{iSL}$, an intuitionistic modal logic with a provability interpretation.
Ian Shillito +3 more
openalex +3 more sources
Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs [PDF]
Workshop on Logic, Language, Information and Computation, 2017 We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.
Yury Savateev, Daniyar S. Shamkanov
semanticscholar +3 more sources
Elimination of cuts in first-order finite-valued logics [PDF]
, 1994 A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established.
Matthias Baaz +2 more
openalex +6 more sources
The Structure of Differential Invariants and Differential Cut Elimination [PDF]
Logical Methods in Computer Science, 2012 The biggest challenge in hybrid systems verification is the handling of differential equations. Because computable closed-form solutions only exist for very simple differential equations, proof certificates have been proposed for more scalable ...
Andre Platzer
doaj +5 more sources
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 +4 more sources
Full Cut Elimination and Interpolation for Intuitionistic Logic with Existence Predicate
Bulletin of the Section of Logic, 2019 In previous work by Baaz and Iemhoff, a Gentzen calculus for intuitionistic logic with existence predicate is presented that satisfies partial cut elimination and Craig's interpolation property; it is also conjectured that interpolation fails for the ...
Paolo Maffezioli, Eugenio Orlandelli
openalex +3 more sources
Free Definite Description Theory – Sequent Calculi and Cut Elimination
Logic and Logical Philosophy, 2020 We provide an application of a sequent calculus framework to the formalization of definite descriptions. It is a continuation of research undertaken in [20, 22].
Andrzej Indrzejczak
openalex +3 more sources
Logique et Analyse, 2018 This is an exposition of Novikov's cut-elimination procedure for a Hilbert-style formulation of the first-order predicate calculus, which depends on a property of formulas introduced by him, called 'regularity'. A comparison with other methods is outlined.
L. Bellotti
semanticscholar +3 more sources
Semantic A-translations and Super-Consistency Entail Classical Cut Elimination [PDF]
Logic Programming and Automated Reasoning, 2013 We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question.
L. Allali, O. Hermant
semanticscholar +7 more sources