A note of definable skolem functions
A note on a proof of Sherpherdson.
A note on a result of Buss concerning bounded theories and the collection scheme.
A note on bounded arithmetic
A note on frame distributions
A note on negative tagging for least fixed-point formulae
A Note on Negative Tagging for Least Fixed-Point Formulae
Proof systems with sequents of the form U ⊢ Φ for proving validity of a propositional modal μ-calculus formula Φ over a set U of states in a given model usually handle fixed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel for annotating fixed-point formulae with information about the proof states at which these are unfolded. This information is used later in the proof to avoid unnecessary unfolding, without...
A note on proofs of falsehood.
A note on the Mac Dowell-Specker theorem
A note on the quasi-antiorder in a semigroup.
A note on Δ₁ induction and Σ₁ collection
Slaman recently proved that Σₙ collection is provable from Δₙ induction plus exponentiation, partially answering a question of Paris. We give a new version of this proof for the case n = 1, which only requires the following very weak form of exponentiation: " exists for some y sufficiently large that x is smaller than some primitive recursive function of y".
A Parigot-style linear -calculus for full intuitionistic linear logic.
A partition theorem for α-large sets
A Proof Procedure for the First Order Logic
A proof theoretical fine structure in systems of ramified analysis.
A recursion-theoretic characterization of instances of provable in
A sentence that is difficult to interpret
A sequence of theories for arithmetic whose union is complete
A simple detailed proof for Goedel's incompleteness theorem
A Theorem on Anti-ordered Factor-semigroups