Sciweavers

AML
2006
87views more  AML 2006»
14 years 16 days ago
Herbrand's theorem and term induction
We study the formal rst order system Tind in the standard language of Gentzen's LK. Tind extends LK by the purely logical rule of term-induction, that is a restricted inductio...
Matthias Baaz, Georg Moser
AML
2006
120views more  AML 2006»
14 years 16 days ago
On the infinite-valued Lukasiewicz logic that preserves degrees of truth
Lukasiewicz's infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Lukasiewicz algebra on the unit real interva...
Josep Maria Font, Àngel J. Gil, Antoni Torr...
AML
2006
83views more  AML 2006»
14 years 16 days ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
AML
2006
103views more  AML 2006»
14 years 16 days ago
Decision methods for linearly ordered Heyting algebras
Abstract. The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable;...
Roy Dyckhoff, Sara Negri
AML
2006
81views more  AML 2006»
14 years 16 days ago
Small Pi01 Classes
Stephen Binns
AML
2006
87views more  AML 2006»
14 years 16 days ago
On the rules of intermediate logics
If the Visser rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate log...
Rosalie Iemhoff
AML
2006
106views more  AML 2006»
14 years 16 days ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
AML
2006
85views more  AML 2006»
14 years 16 days ago
Arithmetical Sacks Forcing
Abstract. We answer a question of Jockusch by constructing a hyperimmunefree minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical ...
Rod Downey, Liang Yu
AML
2006
47views more  AML 2006»
14 years 16 days ago
Model completeness for trivial, uncountably categorical theories of Morley rank 1
Alfred Dolich, Michael C. Laskowski, Alexander Rai...