We discuss several ontological properties of explicit mathematics and operational set theory: global choice, decidable classes, totality and extensionality of operations, function spaces, class and set formation via formulas that contain the definedness predicate and applications.

Leonid Levin showed that every algorithm computing a function has an optimal inverter. Recently, we applied his result in various contexts: existence of optimal acceptors, existence of hard sequences for algorithms and proof systems, proofs of Gödel’s incompleteness theorems, analysis of the complexity of the clique problem assuming the nonuniform Exponential Time Hypothesis. We present all these applications here. Even though a simple diagonalization yields Levin’s result, we believe that it is worthwhile to be aware of the explicit result. The purpose of this survey is to convince the reader of our view.

We try to recast in modern terms a choice principle conceived by Beppo Levi, who called it the Approximation Principle (AP). Up to now, there was almost no discussion about Levi’s contribution, due to the quite obscure formulation of AP the author has chosen. After briefly reviewing the historical and philosophical surroundings of Levi’s proposal, we undertake our own attempt at interpreting AP. The idea underlying the principle, as well as the supposed faithfulness of our version to Levi’s original intention, are then discussed. Finally, an application of AP to a property of metric spaces is presented, with the aim of showing how AP may work in contexts where other forms of choice are commonly at use.

Frege explained the notion of generality by stating that each its instance is a fact, and added only later the crucial observation that a generality can be inferred from an arbitrary instance. The reception of Frege’s quantifiers was a fifty-year struggle over a conceptual priority: truth or provability. With the former as the basic notion, generality had to be faced as an infinite collection of facts, whereas with the latter, generality was based on a uniformity with a finitary sense: the provability of an arbitrary instance.

We raise an issue of circularity in the argument for the completeness of first-order logic. An analysis of the problem sheds light on the development of mathematics, and suggests other possible directions for foundational research.

We give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models, and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey’s Theorem for Pairs.

The history of productivity of the κ-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every regular cardinal $\kappa > \aleph _1 {\rm{,}}$ the principle □(k) is equivalent to the existence of a certain strong coloring $c\,:\,[k]^2 \, \to $k for which the family of fibers ${\cal T}\left( c \right)$ is a nonspecial κ-Aronszajn tree.

The theorem follows from an analysis of a new characteristic function for walks on ordinals, and implies in particular that if the κ-chain condition is productive for a given regular cardinal $\kappa > \aleph _1 {\rm{,}}$ then κ is weakly compact in some inner model of ZFC. This provides a partial converse to the fact that if κ is a weakly compact cardinal, then the κ-chain condition is productive.

Paul Erdős (26 March 1913—20 September 1996) was a mathematician par excellence whose results and initiatives have had a large impact and made a strong imprint on the doing of and thinking about mathematics. A mathematician of alacrity, detail, and collaboration, Erdős in his six decades of work moved and thought quickly, entertained increasingly many parameters, and wrote over 1500 articles, the majority with others. His modus operandi was to drive mathematics through cycles of problem, proof, and conjecture, ceaselessly progressing and ever reaching, and his modus vivendi was to be itinerant in the world, stimulating and interacting about mathematics at every port and capital.

We point out how the “Fundamental Theorem of Stability Theory”, namely the equivalence between the “non order property” and definability of types, proved by Shelah in the 1970s, is in fact an immediate consequence of Grothendieck’s “Critères de compacité” from 1952. The familiar forms for the defining formulae then follow using Mazur’s Lemma regarding weak convergence in Banach spaces.

We provide an introduction to methods and recent results on infinitely generated abelian groups with decidable word problem.

We propose a criterion to regard a property of a theory (in first or second order logic) as virtuous: the property must have significant mathematical consequences for the theory (or its models). We then rehearse results of Ajtai, Marek, Magidor, H. Friedman and Solovay to argue that for second order logic, ‘categoricity’ has little virtue. For first order logic, categoricity is trivial; but ‘categoricity in power’ has enormous structural consequences for any of the theories satisfying it. The stability hierarchy extends this virtue to other complete theories. The interaction of model theory and traditional mathematics is examined by considering the views of such as Bourbaki, Hrushovski, Kazhdan, and Shelah to flesh out the argument that the main impact of formal methods on mathematics is using formal definability to obtain results in ‘mainstream’ mathematics. Moreover, these methods (e.g., the stability hierarchy) provide an organization for much mathematics which gives specific content to dreams of Bourbaki about the architecture of mathematics.

Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Martin-Löf random set that does not compute the halting problem.