Classifying singularities up to analytic extensions of scalars is smooth Fulltext Access 17 Pages 2011
Groups elementarily equivalent to a free nilpotent group of finite rank Fulltext Access 18 Pages 2011
Reasoning about conditional probabilities in a higher-order-logic theorem prover Fulltext Access 18 Pages 2011
Praise, blame, obligation, and DWE: Toward a framework for classical supererogation and kin Fulltext Access 18 Pages 2011
Formal reliability analysis of combinational circuits using theorem proving Fulltext Access 20 Pages 2011
The provably total NP search problems of weak second order bounded arithmetic Fulltext Access 28 Pages 2011
Some model-theoretic correspondences between dimension groups and AF algebras Fulltext Access 31 Pages 2011
Greatly ErdÅs cardinals with some generalizations to the Chang and Ramsey properties Fulltext Access 40 Pages 2011
The strength of extensionality II — Weak weak set theories without infinity Fulltext Access 68 Pages 2011
Infinitely Peano differentiable functions in polynomially bounded o-minimal structures Fulltext Access 5 Pages 2010
Martin’s Axiom and embeddings of upper semi-lattices into the Turing degrees Fulltext Access 8 Pages 2010
Admissible rules in the implication–negation fragment of intuitionistic logic Fulltext Access 10 Pages 2010
On the T1 axiom and other separation properties in constructive point-free and point-set topology Fulltext Access 10 Pages 2010
Computability of finite-dimensional linear subspaces and best approximation Fulltext Access 12 Pages 2010
Elementary differences between the degrees of unsolvability and degrees of compressibility Fulltext Access 12 Pages 2010
Some theorems on the algorithmic approach to probability theory and information theory Fulltext Access 12 Pages 2010
A characterization of the Language Invariant families satisfying Spectrum Exchangeability in Polyadic Inductive Logic Fulltext Access 12 Pages 2010
Classical descriptive set theory as a refinement of effective descriptive set theory Fulltext Access 13 Pages 2010
Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction) Fulltext Access 14 Pages 2010
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances Fulltext Access 15 Pages 2010
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA Fulltext Access 15 Pages 2010
The computable Lipschitz degrees of computably enumerable sets are not dense Fulltext Access 15 Pages 2010
Axiomatizing hybrid products: How can we reason many-dimensionally in hybrid logic? Fulltext Access 16 Pages 2010
Generic embeddings associated to an indestructibly weakly compact cardinal Fulltext Access 17 Pages 2010