# Defining Logical Systems via Algebraic Constraints on Proofs

@article{Gheorghiu2023DefiningLS, title={Defining Logical Systems via Algebraic Constraints on Proofs}, author={Alexander Gheorghiu and David J. Pym}, journal={ArXiv}, year={2023}, volume={abs/2301.02125} }

We comprehensively present a program of decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof system for a target logic by enriching a proof system for another, typically 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 algebra to give constraints in a sequent…

## One Citation

### Proof-theoretic Semantics and Tactical Proof

- Philosophy, Computer ScienceArXiv
- 2023

This work uses proof-theoretic validity in the Dummett-Prawitz tradition to define validity of arguments, and uses the theory of tactical proof to relate arguments, inference, and search.

## 64 References

### Elements Of Intuitionism

- Art
- 2016

Thank you for reading elements of intuitionism. As you may know, people have search hundreds times for their chosen novels like this elements of intuitionism, but end up in malicious downloads.…

### Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi

- Philosophy
- 1963

Publisher Summary This chapter discusses semantical analysis of modal logic ii and non-normal modal propositional calculi. The proof of sufficiency, which is omitted by many, proceeds by constructing…

### Relating Labelled and Label-Free Bunched Calculi in BI Logic

- Computer Science, MathematicsTABLEAUX
- 2019

This paper defines a labelled sequent calculus, called \(\mathrm {GBI}\), in which labels and constraints reflect the properties of a specifically tailored Kripke resource semantics of \(\Mathrm {BI}\) with two total resource composition operators and explicit internalization of inconsistency.

### Proof Methods for Modal and Intuitionistic Logics

- Philosophy
- 1983

One / Background.- Two / Analytic Modal Tableaus and Consistency Properties.- Three / Logical Consequence, Compactness, Interpolation, and Other Topics.- Four / Axiom Systems and Natural Deduction.-…

### Internalizing labelled deduction

- Computer ScienceJ. Log. Comput.
- 2000

This paper shows how to internalize the Kripke satisfaction definition using the basic hybrid language and explores the proof theoretic consequences of doing so, and concludes with some reflections on the status of labelling in modal logic.

### Structural proof theory

- Mathematics
- 2001

From natural deduction to sequent calculus, diversity and unity in structural proof theory are explored and the quantifiers are explained.

### First-order modal tableaux

- Computer ScienceJournal of Automated Reasoning
- 2004

We describe simple semantic tableau based theorem provers for four standard modal logics, in both propositional and first-order versions. These theorem provers are easy to implement in Prolog, have a…

### Contraction-free sequent calculi for geometric theories with an application to Barr's theorem

- MathematicsArch. Math. Log.
- 2003

Abstract. Geometric theories are presented as contraction- and cut-free systems of sequent calculi with mathematical rules following a prescribed rule-scheme that extends the scheme given in Negri…

### Logic programming in a fragment of intuitionistic linear logic

- Computer Science[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
- 1991

The intuitionistic notion of context is refined by using a fragment of J.-Y. Girard's (Theor. Comput. Sci., vol.50, p.1-102, 1987) linear logic that includes additive and multiplicative conjunction,…

### Implementing the Linear Logic Programming Language Lygon

- Computer ScienceILPS
- 1995

This paper investigates the implementation of Lygon, Girard's linear logic, and presents solutions to two problems that arise, the division of resources between sub-branches of the proof and the selection of the formula to be decomposed.