NDJFL
2002
13 years 10 months ago
2002
In any nonstandard model of Peano arithmetic, the standard part is not first order definable. But we show that in some model the standard part is definable as the unique solution ...
AML
2005
13 years 10 months ago
2005
We apply Mints' technique for proving the termination of the epsilon substitution method via cut-elimination to the system of Peano Arithmetic with Transfinite Induction give...
APAL
2006
13 years 11 months ago
2006
We aim at a conceptually clear and technical smooth investigation of Ackermann's substitution method. Our analysis provides a direct classification of the provable recursive ...
APAL
2010
13 years 11 months ago
2010
In an earlier paper (MLQ 54, 128
AML
2010
13 years 11 months ago
2010
We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free p...
CSL
2007
Springer
14 years 5 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
BIRTHDAY
2007
Springer
14 years 5 months ago
2007
Springer
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
CIE
2009
Springer
14 years 5 months ago
2009
Springer
We give a combinatorial proof of a tight relationship between the Kanamori-McAloon principle and the Paris-Harrington theorem with a number-theoretic parameter function. We show th...