#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2010

2016

- This year (0)
- Last five years (10)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Graham Emil Leigh, Michael Rathjen
- Arch. Math. Log.
- 2010

The first attempt at a systematic approach to axiomatic theories of truth was undertaken by Friedman and Sheard [11]. There twelve principles consisting of axioms, axiom schemata and rules of inference, each embodying a reasonable property of truth were isolated for study. Working with a base theory of truth conservative over PA, Friedman and Sheard raised… (More)

- Graham Emil Leigh
- J. Symb. Log.
- 2015

We present a cut elimination argument that witnesses the conservativity of the compositional axioms for truth (without the extended induction axiom) over any theory interpreting a weak subsystem of arithmetic. In doing so we also fix a critical error in Halbach's original presentation. Our methods show that the admission of these axioms determines a… (More)

- Graham Emil Leigh, Michael Rathjen
- J. Symb. Log.
- 2012

This paper compares the roles classical and intuitionistic logic play in restricting the free use of truth principles in arithmetic. We consider fifteen of the most commonly used axiomatic principles of truth and classify every subset of them as either consistent or inconsistent over a weak purely intuitionistic theory of truth.

- Graham Emil Leigh
- Ann. Pure Appl. Logic
- 2013

This paper explores the interface between principles of self-applicable truth and classical logic. To this end, the proof-theoretic strength of a number of axiomatic theories of truth over intuitionistic logic is determined. The theories considered correspond to the maximal consistent collections of fifteen truth-theoretic principles as isolated in Leigh… (More)

Some remarks on extending and interpreting theories with a partial predicate for truth. Much of the literature on theories of truth can be traced back to Kripke's seminal paper, Outline of a theory of truth. Kripke's aim was to provide an account of self-applicable truth which avoided the inconsistencies highlighted by Tarski's theorem. This involved… (More)

- Bahareh Afshari, Stefan Hetzl, Graham Emil Leigh
- TLCA
- 2015

Recently a new connection between proof theory and formal language theory was introduced. It was shown that the operation of cut elimination for proofs in first-order predicate logic involving Π 1-cuts corresponds to computing the language of a particular class of regular tree grammars. The present paper expands this connection to the level of Π 2-cuts.… (More)

- Graham Emil Leigh, Carlo Nicolai
- Rew. Symb. Logic
- 2013

Richard Heck in [2] and Volker Halbach in [1] have recently manifested much interest in an unconventional way of constructing (axiomatic) theories of truth, in which syntactic and logical notions concerning the object theory O are formalised in a disjoint theory of syntax S. In the talk, I shall first argue for the proposed alternative. I will then present… (More)

- Graham E. Leigh
- 2012

In this article we present a number of axiomatic theories of truth which are conservative extensions of arithmetic. We isolate a set of ten natural principles of truth and prove that every consistent permutation of them forms a theory conservative over Peano arithmetic. It seems that each axiomatic theory of truth that occurs in the literature is equipped… (More)

- Bahareh Afshari, Graham Emil Leigh
- CSL
- 2013

The closure ordinal of a formula of modal µ-calculus µXϕ is the least ordinal κ, if it exists, such that the denotation of the formula and the κ-th iteration of the monotone operator induced by ϕ coincide across all transition systems (finite and infinite). It is known that for every α < ω 2 there is a formula ϕ of modal logic such that µXϕ has closure… (More)

The closure ordinal of a formula of modal µ-calculus µXϕ is the least ordinal κ, if it exists, such that the denotation of the formula and the κ-th iteration of the monotone operator induced by ϕ coincide across all transition systems (finite and infinite). It is known that for every α < ω 2 there is a formula ϕ of modal logic such that µXϕ has closure… (More)