A theory of local negation: the model and some applications.
A Theory Of Variable Types.
A topological interpretation of second-order intuitionistic arithmetic
A version of the ...1-reflection principle for CFA provable in PRA.
A well-ordering proof for Feferman's theory To.
Addendum to “A note on the MacDowell–Specker theorem”
Algebraic models of intuitionistic theories of sets and classes.
Algorithmic Constructions Inspired By Caporaso
Algorithmic constructions inspired by Caporaso.
Almost locatedness in uniform spaces
A weak form of the constructively important notion of locatedness is lifted from the context of a metric space to that of a uniform space. Certain fundamental results about almost located and totally bounded sets are then proved.
Alternative models in precipitation analysis.
Ambiguity and stratification
An algebraic approach to the Heyting-Brouwer predicate calculus
An application of a reflection principle
We define a recursive theory which axiomatizes a class of models of IΔ₀ + Ω ₃ + ¬ exp all of which share two features: firstly, the set of Δ₀ definable elements of the model is majorized by the set of elements definable by Δ₀ formulae of fixed complexity; secondly, Σ₁ truth about the model is recursively reducible to the set of true Σ₁ formulae of fixed complexity.
An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions.
An interpretation of in -NIA.
An Ordering of the set of Sentences of Peano Arithmetic
An upper bound on the space complexity of random formulae in resolution
We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in -CNF on variables and clauses is .
An Upper Bound on the Space Complexity of Random Formulae in Resolution
We prove that, with high probability, the space complexity of refuting a random unsatisfiable Boolean formula in k-CNF on n variables and m = Δn clauses is .
Application de la généralisation du principe de correspondance à la théorie de l'élimination