Defining Logical Systems via Algebraic Constraints on Proofs

01/05/2023
by   Alexander V. Gheorghiu, et al.
0

We provide a comprehensive presentation of a program of uniform decomposition of proof systems for non-classical logics into other logics, especially classical logic, by means of an algebra of constraints. That is, one recovers a proof system for a target logic by enriching a proof system for a simpler logic with an algebra of constraints that act as correctness conditions on the latter to capture the former; for example, one may use Boolean constraints in the consequent in a sequent calculus for classical logic to produce a sequent calculus for intuitionistic logic. The idea behind such forms of reduction it to obtain a tool for uniform and modular treatment of proof theory, and provide a bridge between semantics of more complex logics and their proof theory. The article discusses the theoretic background of the project and provides several illustrations of its work in the field of intuitionistic and modal logics. Some results include a uniform treatment of modular and cut-free proof systems for a large class of propositional logics, a general criterion for a novel approach to soundness and completeness of a logic with respect to a model-theoretic semantics, and a case-study deriving a model-theoretic semantics from a proof-theoretic specification of a logic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2023

An ecumenical view of proof-theoretic semantics

Debates concerning philosophical grounds for the validity of classical a...
research
10/24/2018

A general proof certification framework for modal logic

One of the main issues in proof certification is that different theorem ...
research
04/23/2020

Proof Theory of Riesz Spaces and Modal Riesz Spaces

We design hypersequent calculus proof systems for the theories of Riesz ...
research
02/10/2021

Finite axiomatizability of logics of distributive lattices with negation

This paper focuses on order-preserving logics defined from varieties of ...
research
01/08/2021

A Rewriting Logic Approach to Specification, Proof-search, and Meta-proofs in Sequent Systems

This paper develops an algorithmic-based approach for proving inductive ...
research
07/15/2020

Computational Logic for Biomedicine and Neurosciences

We advocate here the use of computational logic for systems biology, as ...
research
07/14/2020

Nonclassical truth with classical strength. A proof-theoretic analysis of compositional truth over HYPE

Questions concerning the proof-theoretic strength of classical versus no...

Please sign up or login with your details

Forgot password? Click here to reset