Related papers: On Dividing by Two in Constructive Mathematics
The theory of $(\mathbb{R},<,+,\mathbb{Z},\mathbb{Z} a)$ is decidable if $a$ is quadratic. If $a$ is the golden ratio, $(\mathbb{R},<,+,\mathbb{Z},\mathbb{Z} a)$ defines multiplication by $a$. The results are established by using the…
Category theory gives a mathematical characterization of naturality but not of canonicity. The purpose of this paper is to develop the logical theory of canonical maps based on the broader demonstration that the dual notions of elements &…
We show that if a countable structure $M$ in a finite relational language is not cellular, then there is an age-preserving $N \supseteq M$ such that $2^{\aleph_0}$ many structures are bi-embeddable with $N$. The proof proceeds by a case…
If the sequent (Gamma entails forall x exists y A) is provable in first order constructive natural deduction, then the theory (Gamma, forall x (f (x)/y)A), where f is a new function symbol, is a conservative extension of Gamma.
Elimination of quantifiers is shown to fail dramatically for a group of well-known mathematical theories (classically enjoying the property) against a wide range of relevant logical backgrounds. Furthermore, it is suggested that only by…
Constructor theory seeks to express all fundamental scientific theories in terms of a dichotomy between possible and impossible physical transformations - those that can be caused to happen and those that cannot. This is a departure from…
Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in…
We prove a structural result for sets of integers with doubling at most $4 + \delta$, with $\delta>0$ sufficiently small. This generalises earlier work of Eberhard--Green--Manners which dealt with sets of integers with doubling strictly…
The letter submitted is an executive summary of our previous paper. To solve the Einstein Podolsky Rosen 'paradox' the two boundary quantum mechanics is taken as self consistent interpretation of quantum dynamics. The difficulty with this…
We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
We prove without appeal to the Axiom of Choice that for any sets A and B, if there is a one-to-one correspondence between 3 cross A and 3 cross B then there is a one-to-one correspondence between A and B. The first such proof, due to…
Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
Many writers have observed that default logics appear to contain the "lottery paradox" of probability theory. This arises when a default "proof by contradiction" lets us conclude that a typical X is not a Y where Y is an unusual subclass of…
Constructivists (and intuitionists in general) asked what kind of mental construction is needed to convince ourselves (and others) that some mathematical statement is true. This question has a much more practical (and even cynical)…
General relativity required the abandonment of Euclidean geometry. Here we show that quantum theory requires the abandonment of classical logic. We show that the Hilbert space representation of quantum theory is logically inevitable. There…
The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas. Surprisingly, this logic is constructive and so…
Theorem: The topological partition relation omega^{*}-> (Y)^{1}_{2} (a) fails for every space Y with |Y| >= 2^c ; (b) holds for Y discrete if and only if |Y| <= c; (c) holds for certain non-discrete P-spaces Y ; (d) fails for Y= omega cup…
We introduce a restriction of the classical 2-party deterministic communication protocol where Alice and Bob are restricted to using only comparison functions. We show that the complexity of a function in the model is, up to a constant…