The Ramsey-sentence H* of any hypothesis H is shown to be a synthetic proposition containing mathematics as a finite component. Far from being quasi-tautological, H* proves to have as much physical content as H itself.

Since Turing proposed the first test of intelligence, several modifications have been proposed with the aim of making Turing’s proposal more realistic and applicable in the search for artificial intelligence. In the modern context, it turns out that some of these definitions of intelligence and the corresponding tests merely measure computational power. Furthermore, in the framework of the original Turing test, for a system to prove itself to be intelligent, a certain amount of deceit is implicitly required which can have (...) serious security implications for future human societies. In this article, we propose a unified framework for developing intelligence tests which takes care of important ethical and practical issues. Our proposed framework has several important consequences. Firstly, it results in the suggestion that it is not possible to construct a single, context independent, intelligence test. Secondly, any measure of intelligence must have access to the process by which a problem is solved by the system under consideration and not merely the final solution. Finally, it requires an intelligent agent to be evolutionary in nature with the flexibility to explore new algorithms on its own. (shrink)

We develop a framework for natural language semantics which handles intensionality via metalogical constructions and deals with degree truth values in an integrated way. We take an axiomatic set theory, ZF, as the foundation for semantic representations, but we make ZF a metalanguage for part of itself by embedding a language ℒ within ZF which is basically a copy of the part of ZF consisting of set expressions. This metalogical set-up is used for handling propositional attitude verbs (limited to believe (...) in this paper). We define a truth function τ which determines the truth value τ(p, T) of an ℒ-proposition p with respect to a theory T. Theories are sets of ℒ-propositions with associated truth values, and can be viewed as a (much more well-defined) replacement for possible worlds. We develop a mechanism for defining belief worlds as theories. We simultaneously develop two different versions of our system - a Boolean version where the set Ω of truth values is {0, 1}, and a degree-truth version where Ω is the interval [0, 1] of real numbers. We use degrees of truth in handling a broad class of semantic predicates that we call base-focus predicates, which include generalized quantifiers as well as many adverb and adjective senses and certain discourse-level predicates. (shrink)

We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounded truth predicate on the ordinals. The class of sets of ordinals which can be read off the truth predicate satisfies a natural theory SO. SO is the theory of the sets of ordinals in a model of the Zermelo-Fraenkel axioms ZFC. This allows the following characterization of computable sets: a set of ordinals is ordinal register (...) computable if and only if it is an element of Gödel’s constructible universe L. (shrink)

– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

It is argued that mathematical statements are "a posteriori synthetic" statements of a very special sort, To be called "structure-Analytic" statements. They follow logically from the axioms defining the mathematical structure they are describing--Provided that these axioms are "consistent". Yet, Consistency of these axioms is an empirical claim: it may be "empirically verifiable" by existence of a finite model, Or may have the nature of an "empirically falsifiable hypothesis" that no contradiction can be derived from the axioms.

Modal Platonism utilizes "weak" logical possibility, such that it is logically possible there are abstract entities, and logically possible there are none. Modal Platonism also utilizes a non-indexical actuality operator. Modal Platonism is the EASY WAY, neither reductionist nor eliminativist, but embracing the Platonistic language of abstract entities while eliminating ontological commitment to them. Statement of Modal Platonism. Any consistent statement B ontologically committed to abstract entities may be replaced by an empirically equivalent modalization, MOD(B), not so ontologically committed. This (...) equivalence is provable using Modal/Actuality Logic S5@. Let MAX be a strong set theory with individuals. Then the following Schematic Bombshell Result (SBR) can be shown: MAX logically yields [T is true if and only if MOD(T) is true], for scientific theories T. The proof utilizes Stephen Neale's clever model-theoretic interpretation of Quantified Lewis S5, which I extend to S5@. (shrink)

Structural Realism (SSR), as embodied in the Ramsey-sentence H of a theory H, is defended against the view that H reduces to a trivial statement about the cardinally of the domain of H, a view which arises from ignoring the central role of observation within science. Putnam's theses are examined and shown to support rather than undermine SSR. Finally: in view of its synthetic character, applied mathematics must enter into the formulation of H and hence to be shown axiomatisable; this (...) is done in the Appendix, which is the most important part of the paper. (shrink)

In this paper some of the history of the development of arithmetic in set theory is traced, particularly with reference to the problem of avoiding the assumption of an infinite set. Although the standard method of singling out a sequence of sets to be the natural numbers goes back to Zermelo, its development was more tortuous than is generally believed. We consider the development in the light of three desiderata for a solution and argue that they can probably not all (...) be satisfied simultaneously. (shrink)

Structural Realism (SSR), as embodied in the Ramsey-sentence H* of a theory H, is defended against the view that H* reduces to a trivial statement about the cardinality of the domain of H, a view which arises from ignoring the central role of observation within science. Putnam’s theses are examined and shown to support rather than undermine SSR. Finally: in view of its synthetic character, applied mathematics must enter into the formulation of H* and hence be shown to be finitely (...) axiomatisable; this is done in the Appendix, which is the most important part of the paper. (shrink)

Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...) perturbations in modal space to bear on the debate, we will suggest that a promising option for representing current set-theoretic thought is given by formulating set theory using quasi-weak second-order logic. These observations indicate that the usual division of structures into \particular (e.g. the natural number structure) and general (e.g. the group structure) is perhaps too coarse grained; we should also make a distinction between intentionally and unintentionally general structures. (shrink)

The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity in set theory. (...) Thus, the pair of arithmetic and set are to be similar to Euclidean and non-Euclidean geometries distinguishably only by the Fifth postulate now, i.e. after replacing it and its negation correspondingly by the axiom of finiteness (induction) versus that of finiteness being idempotent negations to each other. Indeed, the axiom of choice, as far as it is equivalent to the well-ordering “theorem”, transforms any set in a well-ordering either necessarily finite according to the axiom of induction or also optionally infinite according to the axiom of infinity. So, the Gödel incompleteness statement relies on the logical contradiction of the axiom of induction and the axiom of infinity in the final analysis. Nonetheless, both can be considered as two idempotent versions of the same axiom (analogically to the Fifth postulate) and then unified after logicism and its inherent intensionality since the opposition of finiteness and infinity can be only extensional (i.e., relevant to the elements of any set rather than to the set by itself or its characteristic property being a proposition). So, the pathway for interpreting the Gödel incompleteness statement as an axiom and the originating from that assumption for “Hilbert mathematics” accepting its negation is pioneered. A much wider context relevant to realizing the Gödel incompleteness statement as a metamathematical axiom is consistently built step by step. The horizon of Hilbert mathematics is the proper subject in the third part of the paper, and a reinterpretation of Gödel’s papers (1930; 1931) as an apology of logicism as the only consistent foundations of mathematics is the topic of the next second part. (shrink)

We examine the question of whether scientific theories can ever be complete. For two closely related reasons, we will argue that they cannot. The first reason is the inability to determine what are “valid empirical observations”, a result that is based on a self-reference Gödel/Tarski-like proof. The second reason is the existence of “meta-empirical” evidence of the inherent incompleteness of observations. These reasons, along with theoretical incompleteness, are intimately connected to the notion of belief and to theses within the philosophy (...) of science: the Quine-Duhem (and underdetermination) thesis and the observational/theoretical distinction failure. Some puzzling aspects of the philosophical theses will become clearer in light of these connections. Other results that follow are: no absolute measure of the informational content of empirical data, no absolute measure of the entropy of physical systems, and no complete computer simulation of the natural world are possible. The connections with the mathematical theorems of Gödel and Tarski reveal the existence of other connections between scientific and mathematical incompleteness: computational irreducibility, complexity, infinity, arbitrariness and self-reference. Finally, suggestions will be offered of where a more rigorous (or formal) “proof” of scientific incompleteness can be found. (shrink)

The metaphysics of representation poses questions such as: in virtue of what does a sentence, picture, or mental state represent that the world is a certain way? In the first instance, I have focused on the semantic properties of language: for example, what is it for a name such as ‘London’ to refer to something? Interpretationism concerning what it is for linguistic expressions to have meaning, says that constitutively, semantic facts are fixed by best semantic theory. As here developed, it (...) promises to give a reductive, universal and non-revisionary account of the nature of linguistic representation. -/- Interpretationism in general, however, is threatened by severe internal tension, due to arguments for radical inscrutability. These contend that, given the interpretationist setting, there can be no fact of the matter what object an individual word refers to: for example, that there is no fact of the matter as to whether “London” refers to London or to Sydney. -/- A series of challenges emerge, forming the basis for this thesis. 1. What sort of properties is the interpretationist trying to reduce, and what kind of reductive story is she offering? 2. How are inscrutability theses best formulated? Are arguments for inscrutability effective in their own terms? What kinds of inscrutability arise? 3. Is endorsing radical inscrutability a stable position? 4. Are there theoretical virtues—such as simplicity—that can be appealed to in discrediting the rival (empirically equivalent) theories that underpin inscrutability arguments? -/- In addressing these questions, I concentrate on diagnosing the source of inscrutability, mapping the space of ways of resisting the arguments for radical inscrutability, and examining the challenges faced in developing a principled account of linguistic content that avoids radical inscrutability. -/- The effect is not to close down the original puzzles, but rather to sharpen them into a set of new and deeper challenges. (shrink)

The paper investigates how the mathematical languages used to describe and to observe automatic computations influence the accuracy of the obtained results. In particular, we focus our attention on Single and Multi-tape Turing machines which are described and observed through the lens of a new mathematical language which is strongly based on three methodological ideas borrowed from Physics and applied to Mathematics, namely: the distinction between the object (we speak here about a mathematical object) of an observation and the instrument (...) used for this observation; interrelations holding between the object and the tool used for the observation; the accuracy of the observation determined by the tool. Results of the observation executed by the traditional and new languages are compared and discussed. (shrink)