APAL
2002
13 years 11 months ago
2002
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
APAL
2002
13 years 11 months ago
2002
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
APAL
2002
13 years 11 months ago
2002
In this paper we discuss extensions of Feferman's theory T0 for explicit mathematics by the so-called limit and Mahlo axioms and present a novel approach to constructing natu...
APAL
2002
13 years 11 months ago
2002
eory in the Abstract J. M. E. Hyland June 7, 2001 Dedicated to Anne Troelstra on the occasion of his 60th birthday: with great affection and respect, this small tribute to his infl...
APAL
2002
13 years 11 months ago
2002
Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classe...
APAL
2002
13 years 11 months ago
2002
APAL
2002
13 years 11 months ago
2002
We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) genera...
APAL
2002
13 years 11 months ago
2002
A notion called Herbrand saturation is shown to provide the modeltheoretic analogue of a proof-theoretic method, Herbrand analysis, yielding uniform model-theoretic proofs of a nu...