It is often claimed that the geodesic principle can be recovered as a theorem in general relativity. Indeed, it is claimed that it is a consequence of Einstein's equation (or of the conservation principle that is, itself, a consequence of that equation). These claims are certainly correct, but it may be worth drawing attention to one small qualification. Though the geodesic principle can be recovered as theorem in general relativity, it is not a consequence of Einstein's equation (or (...) the conservation principle) alone. Other assumptions are needed to drive the theorems in question. One needs to put more in if one is to get the geodesic principle out. My goal in this short note is to make this claim precise (i.e., that other assumptions are needed). (shrink)

A theorem due to Bob Geroch and Pong Soo Jang ["Motion of a Body in General Relativity." Journal of Mathematical Physics 16, ] provides a sense in which the geodesic principle has the status of a theorem in General Relativity. I have recently shown that a similar theorem holds in the context of geometrized Newtonian gravitation [Weatherall, J. O. "The Motion of a Body in Newtonian Theories." Journal of Mathematical Physics 52, ]. Here I compare the interpretations of these (...) two theorems. I argue that despite some apparent differences between the theorems, the status of the geodesic principle in geometrized Newtonian gravitation is, mutatis mutandis, strikingly similar to the relativistic case. (shrink)

Harvey Brown believes it is crucially important that the "geodesic principle" in general relativity is an immediate consequence of Einstein's equation and, for this reason, has a different status within the theory than other basic principles regarding, for example, the behavior of light rays and clocks, and the speed with which energy can propagate. He takes the geodesic principle to be an essential element of general relativity itself, while the latter are better seen as contingent facts about the (...) particular matter fields we happen to encounter. The situation seems much less clear and clean to me. There certainly is a sense in which the geodesic principle can be recovered as a theorem in general relativity. But one needs more than Einstein's equation to drive the theorems in question. Other assumptions are needed. One needs to put more in if one is to get the geodesic principle out. My goal in this note is to make this claim precise, i.e., that other assumptions are needed. (shrink)

The status of the geodesic principle in General Relativity has been a topic of some interest in the recent literature on the foundations of spacetime theories. Part of this discussion has focused on the role that a certain energy condition plays in the proof of a theorem due to Bob Geroch and Pong-Soo Jang [“Motion of a Body in General Relativity.” Journal of Mathematical Physics16(1) (1975)] that can be taken to make precise the claim that the geodesic principle (...) is a theorem, rather than a postulate, of General Relativity. In this brief note, I show, by explicit counterexample, that not only is a weaker energy condition than the one Geroch and Jang state insufficient to prove the theorem, but in fact a condition still stronger than the one that they assume is necessary. (shrink)

I examine two claims that arise in Brown’s account of inertial motion. Brown claims there is something objectionable about the way in which the motions of free particles in Newtonian theory and special relativity are coordinated. Brown also claims that since a geodesic principle can be derived in Einsteinian gravitation, the objectionable feature is explained away. I argue that there is nothing objectionable about inertia and that while the theorems that motivate Brown’s second claim can be said to (...) figure in a deductive-nomological explanation, their main contribution lies in their explication rather than their explanation of inertial motion. (shrink)

A theorem due to Bob Geroch and Pong Soo Jang [“Motion of a Body in General Relativity.” Journal of Mathematical Physics 16, ] provides the sense in which the geodesic principle has the status of a theorem in General Relativity. Here we show that a similar theorem holds in the context of geometrized Newtonian gravitation. It follows that in Newtonian gravitation, as in GR, inertial motion can be derived from other central principles of the theory.

The Law of Inertia plays a key role in the scheme of constructive axioms for the General Theory of Relativity. A new formulation of this law which avoids the circularity problems inherent in previous formulations is presented. The empirical status of this law and the manner in which it provides a non-conventional foundation for the Law of Motion and the definition of physical forces is established. First, quite general path structures are discussed which are not defined at the outset in (...) terms of geodesic paths and which require for their description only the local differential topological structure. Secondly, a number of theorems are presented which serve as purely local differential topological criteria for singling out from among the general path structures the geodesic ones that represent the inertial structure of spacetime. (shrink)

Recent work in the physics literature demonstrates that, in particular classes of rotating spacetimes, physical light rays in general do not traverse null geodesics. Having presented this result, we discuss its philosophical significance, both for the clock hypothesis (and, in particular, a recent purported proof thereof for light clocks), and for the operational meaning of the metric field. 1Introduction 2Fletcher's Theorem 2.1Maudlin on the clock hypothesis in special relativity 2.2Fletcher’s result in special relativity 2.3Fletcher’s theorem in general relativity 3Electromagnetism and (...) the Geometrical-Optical Limit 3.1Maxwell’s equations in curved spacetime 3.2The geometrical-optical limit 3.3Rotating spacetimes 3.4Aren’t Gödel spacetimes unphysical? 4The Clock Hypothesis and Chronogeometry 4.1Natural and mathematical observations 4.2Clock registry discord 4.3Chronogeometry 5Conclusion. (shrink)

I discuss singular space-times in the context of the geometrized formulation of Newtonian gravitation. I argue first that geodesic incompleteness is a natural criterion for when a model of geometrized Newtonian gravitation is singular, and then I show that singularities in this sense arise naturally in classical physics by stating and proving a classical version of the Raychaudhuri-Komar singularity theorem.

I describe two approaches to modelling the universe, the one having its origin in topos theory and differential geometry, the other in set theory. The first is synthetic differential geometry. Traditionally, there have been two methods of deriving the theorems of geometry: the analytic and the synthetic. While the analytical method is based on the introduction of numerical coordinates, and so on the theory of real numbers, the idea behind the synthetic approach is to furnish the subject of geometry (...) with a purely geometric foundation in which the theorems are then deduced by purely logical means from an initial body of postulates. The most familiar examples of the synthetic geometry are classical Euclidean geometry and the synthetic projective geometry introduced by Desargues in the 17th century and revived and developed by Carnot, Poncelet, Steiner and others during the 19th century. The power of analytic geometry derives very largely from the fact that it permits the methods of the calculus, and, more generally, of mathematical analysis, to be introduced into geometry, leading in particular to differential geometry (a term, by the way, introduced in 1894 by the Italian geometer Luigi Bianchi). That being the case, the idea of a “synthetic” differential geometry seems elusive: how can differential geometry be placed on a “purely geometric” or “axiomatic” foundation when the apparatus of the calculus seems inextricably involved? To my knowledge there have been two attempts to develop a synthetic differential geometry. The first was initiated by Herbert Busemann in the 1940s, building on earlier work of Paul Finsler. Here the idea was to build a differential geometry that, in its author’s words, “requires no derivatives”: the basic objects in Busemann’s approach are not differentiable manifolds, but metric spaces of a certain type in which the notion of a geodesic can be defined in an intrinsic manner. I shall not have anything more to say about this approach. The second approach, that with which I shall be concerned here, was originally proposed in the 1960s by F.. (shrink)

Traditionally, there have been two methods of deriving the theorems of geometry: the analytic and the synthetic. While the analytical method is based on the introduction of numerical coordinates, and so on the theory of real numbers, the idea behind the synthetic approach is to furnish the subject of geometry with a purely geometric foundation in which the theorems are then deduced by purely logical means from an initial body of postulates. The most familiar examples of the synthetic (...) geometry are classical Euclidean geometry and the synthetic projective geometry introduced by Desargues in the 17th century and revived and developed by Carnot, Poncelet, Steiner and others during the 19th century. The power of analytic geometry derives very largely from the fact that it permits the methods of the calculus, and, more generally, of mathematical analysis, to be introduced into geometry, leading in particular to differential geometry (a term, by the way, introduced in 1894 by the Italian geometer Luigi Bianchi). That being the case, the idea of a “synthetic” differential geometry seems elusive: how can differential geometry be placed on a “purely geometric” or “axiomatic” foundation when the apparatus of the calculus seems inextricably involved? To my knowledge there have been two attempts to develop a synthetic differential geometry. The first was initiated by Herbert Busemann in the 1940s, building on earlier work of Paul Finsler. Here the idea was to build a differential geometry that, in its author’s words, “requires no derivatives”: the basic objects in Busemann’s approach are not differentiable manifolds, but metric spaces of a certain type in which the notion of a geodesic can be defined in an intrinsic manner. I shall not have anything more to say about this approach. The second approach, that with which I shall be concerned here, was originally proposed in the 1960s by F. W. Lawvere, who was in fact striving to fashion a decisive axiomatic framework for continuum mechanics.. (shrink)

For [Formula: see text], the coarse similarity class of A, denoted by [Formula: see text], is the set of all [Formula: see text] such that the symmetric difference of A and B has asymptotic density 0. There is a natural metric [Formula: see text] on the space [Formula: see text] of coarse similarity classes defined by letting [Formula: see text] be the upper density of the symmetric difference of A and B. We study the metric space of coarse similarity classes (...) under this metric, and show in particular that between any two distinct points in this space there are continuum many geodesic paths. We also study subspaces of the form [Formula: see text] where [Formula: see text] is closed under Turing equivalence, and show that there is a tight connection between topological properties of such a space and computability-theoretic properties of [Formula: see text]. We then define a distance between Turing degrees based on Hausdorff distance in the metric space [Formula: see text]. We adapt a proof of Monin to show that the Hausdorff distances between Turing degrees that occur are exactly 0, [Formula: see text], and 1, and study which of these values occur most frequently in the senses of Lebesgue measure and Baire category. We define a degree a to be attractive if the class of all degrees at distance [Formula: see text] from a has measure 1, and dispersive otherwise. In particular, we study the distribution of attractive and dispersive degrees. We also study some properties of the metric space of Turing degrees under this Hausdorff distance, in particular the question of which countable metric spaces are isometrically embeddable in it, giving a graph-theoretic sufficient condition for embeddability. Motivated by a couple of issues arising in the above work, we also study the computability-theoretic and reverse-mathematical aspects of a Ramsey-theoretic theorem due to Mycielski, which in particular implies that there is a perfect set whose elements are mutually 1-random, as well as a perfect set whose elements are mutually 1-generic. Finally, we study the completeness of [Formula: see text] from the perspectives of computability theory and reverse mathematics. (shrink)

Often, when one faces a choice between alternative actions, there are reasons both for and against each alternative. On one way of understanding these words, what one “ought to do all things considered (ATC)” is determined by the totality of these reasons. So, these reasons can somehow be “combined” or “aggregated” to yield an ATC verdict on these alternatives. First, various assumptions about this sort of aggregation of reasons are articulated. Then it is shown that these assumptions allow for the (...) proof of a “Reasons Aggregation Theorem” – parallel to John Harsanyi’s 1955 “Social Aggregation Theorem”. All reasons for action are grounded in reason-providing values; and, for every such reason-providing value, there is in principle a way of measuring how strongly this value counts against each alternative. The theorem tells us that the appropriate measure of how much reason ATC there is against each alternative is simply a weighted sum of the strengths with which these values count against that alternative; the agent ought not ATC to perform an action iff there is ATC more reason against it than against some available alternative. (shrink)

We pursue an account of merging through the use of geodesic semantics, the semantics based on the length of the shortest path on a graph. This approach has been fruitful in other areas of belief change such as revision and update. To this end, we introduce three binary merging operators of propositions defined on the graph of their valuations and we characterize them with a finite set of postulates.

The purpose of this article is to introduce a class of distance-based iterated revision operators generated by minimizing the geodesic distance on a graph. Such operators correspond bijectively to metrics and have a simple finite presentation. As distance is generated by distinguishability, our framework is appropriate for modelling contexts where distance is generated by threshold, and therefore, when measurement is erroneous.

According to recent arguments, the geodesic principle strictly interpreted is compatible with Einstein’s field equations only in pathologically unstable circumstances and, hence, cannot play a fundamental role in the theory. It is shown here that geodesic dynamics can still be coherently reinterpreted within contemporary relativity theory as a universality thesis. By developing an analysis of universality in physics, I argue that the widespread geodesic clustering of diverse free-fall massive bodies observed in nature qualifies as a universality phenomenon. (...) I then show how this near-geodetic clustering can be explained despite the pathologies associated with strict geodesic motion in Einstein’s theory. (shrink)

Representation theorems are often taken to provide the foundations for decision theory. First, they are taken to characterize degrees of belief and utilities. Second, they are taken to justify two fundamental rules of rationality: that we should have probabilistic degrees of belief and that we should act as expected utility maximizers. We argue that representation theorems cannot serve either of these foundational purposes, and that recent attempts to defend the foundational importance of representation theorems are unsuccessful. As (...) a result, we should reject these claims, and lay the foundations of decision theory on firmer ground. (shrink)

Jury theorems are mathematical theorems about the ability of collectives to make correct decisions. Several jury theorems carry the optimistic message that, in suitable circumstances, ‘crowds are wise’: many individuals together (using, for instance, majority voting) tend to make good decisions, outperforming fewer or just one individual. Jury theorems form the technical core of epistemic arguments for democracy, and provide probabilistic tools for reasoning about the epistemic quality of collective decisions. The popularity of jury theorems (...) spans across various disciplines such as economics, political science, philosophy, and computer science. This entry reviews and critically assesses a variety of jury theorems. It first discusses Condorcet's initial jury theorem, and then progressively introduces jury theorems with more appropriate premises and conclusions. It explains the philosophical foundations, and relates jury theorems to diversity, deliberation, shared evidence, shared perspectives, and other phenomena. It finally connects jury theorems to their historical background and to democratic theory, social epistemology, and social choice theory. (shrink)

Recent interest in maximal proper acceleration as a possible principle generalizing the theory of relativity can draw on the differential geometry of tangent bundles, pioneered by K. Yano, E. T. Davies, and S. Ishihara. The differential equations of geodesics of the spacetime tangent bundle are reduced and investigated in the special case of a Riemannian spacetime base manifold. Simple relations are described between the natural lift of ordinary spacetime geodesics and geodesics in the spacetime tangent bundle.

I discuss classical and quantum recurrence theorems in a unified manner, treating both as generalisations of the fact that a system with a finite state space only has so many places to go. Along the way I prove versions of the recurrence theorem applicable to dynamics on linear and metric spaces, and make some comments about applications of the classical recurrence theorem in the foundations of statistical mechanics.

In this article we show that bi-intuitionistic predicate logic lacks the Craig Interpolation Property. We proceed by adapting the counterexample given by Mints, Olkhovikov and Urquhart for intuitionistic predicate logic with constant domains [13]. More precisely, we show that there is a valid implication $\phi \rightarrow \psi $ with no interpolant. Importantly, this result does not contradict the unfortunately named ‘Craig interpolation’ theorem established by Rauszer in [24] since that article is about the property more correctly named ‘deductive interpolation’ (see (...) Galatos, Jipsen, Kowalski and Ono’s use of this term in [5]) for global consequence. Given that the deduction theorem fails for bi-intuitionistic logic with global consequence, the two formulations of the property are not equivalent. (shrink)

In this paper I critically review the long history of attempts to formulate and derive the geodesic principle, which claims that massive bodies follow geodesic paths in general relativity theory. I argue that if the principle is interpreted as a dynamical law of motion describing the actual evolution of gravitating bodies as endorsed by Einstein, then it is impossible to apply the law to massive bodies in a way that is coherent with his own field equations. Rejecting this (...) canonical interpretation, I propose an alternative interpretation of the geodesic principle as a type of universality thesis analogous to the universality behavior exhibited in thermal systems during phase transitions. (shrink)

In this paper I critically review the long history of attempts to formulate and derive the geodesic principle, which claims that massive bodies follow geodesic paths in general relativity theory. I argue that if the principle is interpreted as a dynamical law of motion describing the actual evolution of gravitating bodies as endorsed by Einstein, then it is impossible to apply the law to massive bodies in a way that is coherent with his own field equations. Rejecting this (...) canonical interpretation, I propose an alternative interpretation of the geodesic principle as a type of universality thesis analogous to the universality behavior exhibited in thermal systems during phase transitions. (shrink)

We give a review and critique of jury theorems from a social-epistemology perspective, covering Condorcet’s (1785) classic theorem and several later refinements and departures. We assess the plausibility of the conclusions and premises featuring in jury theorems and evaluate the potential of such theorems to serve as formal arguments for the ‘wisdom of crowds’. In particular, we argue (i) that there is a fundamental tension between voters’ independence and voters’ competence, hence between the two premises of most (...) jury theorems; (ii) that the (asymptotic) conclusion that ‘huge groups are infallible’, reached by many jury theorems, is an artifact of unjustified premises; and (iii) that the (nonasymptotic) conclusion that ‘larger groups are more reliable’, also reached by many jury theorems, is not an artifact and should be regarded as the more adequate formal rendition of the ‘wisdom of crowds’. (shrink)

There is an extensive literature in social choice theory studying the consequences of weakening the assumptions of Arrow's Impossibility Theorem. Much of this literature suggests that there is no escape from Arrow-style impossibility theorems unless one drastically violates the Independence of Irrelevant Alternatives (IIA). In this paper, we present a more positive outlook. We propose a model of comparing candidates in elections, which we call the Advantage-Standard (AS) model. The requirement that a collective choice rule (CCR) be rationalizable by (...) the AS model is in the spirit of but weaker than IIA; yet it is stronger than what is known in the literature as weak IIA (two profiles alike on x, y cannot have opposite strict social preferences on x and y). In addition to motivating violations of IIA, the AS model makes intelligible violations of another Arrovian assumption: the negative transitivity of the strict social preference relation P. While previous literature shows that only weakening IIA to weak IIA or only weakening negative transitivity of P to acyclicity still leads to impossibility theorems, we show that jointly weakening IIA to AS rationalizability and weakening negative transitivity of P leads to no such impossibility theorems. Indeed, we show that several appealing CCRs are AS rationalizable, including even transitive CCRs. (shrink)

We present an extension of the basic revision theory of circular definitions with a unary operator, □. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over circular definitions, analogous to Solovay’s completeness theorem forGLusing arithmetical interpretations. We adapt our proof to (...) a special class of circular definitions as well as to the first-order case. (shrink)

Wegner’s method of flow equations offers a useful tool for diagonalizing a given Hamiltonian and is widely used in various branches of quantum physics. Here, generalizing this method, a condition is derived, under which the corresponding flow of a quantum state becomes geodesic in a submanifold of the projective Hilbert space, independently of specific initial conditions. This implies the geometric optimality of the present method as an algorithm of generating stationary states. The result is illustrated by analyzing some physical (...) examples. (shrink)

This paper begins with a puzzle regarding Lewis' theory of radical interpretation. On the one hand, Lewis convincingly argued that the facts about an agent's sensory evidence and choices will always underdetermine the facts about her beliefs and desires. On the other hand, we have several representation theorems—such as those of (Ramsey 1931) and (Savage 1954)—that are widely taken to show that if an agent's choices satisfy certain constraints, then those choices can suffice to determine her beliefs and desires. (...) In this paper, I will argue that Lewis' conclusion is correct: choices radically underdetermine beliefs and desires, and representation theorems provide us with no good reasons to think otherwise. Any tension with those theorems is merely apparent, and relates ultimately to the difference between how 'choices' are understood within Lewis' theory and the problematic way that they're represented in the context of the representation theorems. For the purposes of radical interpretation, representation theorems like Ramsey's and Savage's just aren't very relevant after all. (shrink)

In this entry, Frege’s logic is introduced and described in some detail. It is shown how the Dedekind-Peano axioms for number theory can be derived from a consistent fragment of Frege’s logic, with Hume’s Principle replacing Basic Law V.

It has been suggested by Clark Glymour that the spatio-temporal structure of the universe might be underdetermined by all observational data that could ever, theoretically, be gathered. It is possible for two spacetimes to be observationally indistinguishable (OI) yet topologically distinct. David Malament extended the argument for the underdetermination of spacetime structure by showing that under quite general conditions (such as the absence of any closed timelike curves) a spacetime will always have an OI counterpart (at least in weak sense). (...) Because the plight of the cosmologist seemed to be so discouraging in this regard, Malament considered the relationship between global properties and OI spacetimes. This information is helpful to the cosmologist. It allows, in principle, one to reject some spacetime models based on observational evidence. In this paper, I consider the relationship between variants of geodesic incompleteness and different senses (some old and some new) of OI. In light of the findings, it seems that (for the most part) the predicament of the cosmologist is not good. Quite generally, versions of geodesic incompleteness are not conserved even under the strongest formulations of OI. (shrink)

The standard representation theorem for expected utility theory tells us that if a subject’s preferences conform to certain axioms, then she can be represented as maximising her expected utility given a particular set of credences and utilities—and, moreover, that having those credences and utilities is the only way that she could be maximising her expected utility. However, the kinds of agents these theorems seem apt to tell us anything about are highly idealised, being always probabilistically coherent with infinitely precise (...) degrees of belief and full knowledge of all a priori truths. Ordinary subjects do not look very rational when compared to the kinds of agents usually talked about in decision theory. In this paper, I will develop an expected utility representation theorem aimed at the representation of those who are neither probabilistically coherent, logically omniscient, nor expected utility maximisers across the board—that is, agents who are frequently irrational. The agents in question may be deductively fallible, have incoherent credences, limited representational capacities, and fail to maximise expected utility for all but a limited class of gambles. (shrink)

We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection.

The paper is a contribution to intuitionistic reverse mathematics. We introduce a formal system called Basic Intuitionistic Mathematics BIM, and then search for statements that are, over BIM, equivalent to Brouwer’s Fan Theorem or to its positive denial, Kleene’s Alternative to the Fan Theorem. The Fan Theorem is true under the intended intuitionistic interpretation and Kleene’s Alternative is true in the model of BIM consisting of the Turing-computable functions. The task of finding equivalents of Kleene’s Alternative is, intuitionistically, a nontrivial (...) extension of the task of finding equivalents of the Fan Theorem, although there is a certain symmetry in the arguments that we shall try to make transparent. We introduce closed-and-separable subsets of Baire space $${\mathcal{N}}$$ and of the set $${\mathcal{R}}$$ of the real numbers. Such sets may be compact and also positively noncompact. The Fan Theorem is the statement that Cantor space $${\mathcal{C}}$$, or, equivalently, the unit interval [0, 1], is compact and Kleene’s Alternative is the statement that $${\mathcal{C}}$$, or, equivalently, [0, 1], is positively noncompact. The class of the compact closed-and-separable sets and also the class of the closed-and-separable sets that are positively noncompact are characterized in many different ways and a host of equivalents of both the Fan Theorem and Kleene’s Alternative is found. (shrink)

Along the same line as that in Ono (Ann Pure Appl Logic 161:246–250, 2009), a proof-theoretic approach to Glivenko theorems is developed here for substructural predicate logics relative not only to classical predicate logic but also to arbitrary involutive substructural predicate logics over intuitionistic linear predicate logic without exponentials QFLe. It is shown that there exists the weakest logic over QFLe among substructural predicate logics for which the Glivenko theorem holds. Negative translations of substructural predicate logics are studied by (...) using the same approach. First, a negative translation, called extended Kuroda translation is introduced. Then a translation result of an arbitrary involutive substructural predicate logics over QFLe is shown, and the existence of the weakest logic is proved among such logics for which the extended Kuroda translation works. They are obtained by a slight modification of the proof of the Glivenko theorem. Relations of our extended Kuroda translation with other standard negative translations will be discussed. Lastly, algebraic aspects of these results will be mentioned briefly. In this way, a clear and comprehensive understanding of Glivenko theorems and negative translations will be obtained from a substructural viewpoint. (shrink)

This paper introduces Agreement Theorems to dynamic-epistemic logic. We show first that common belief of posteriors is sufficient for agreement in epistemic-plausibility models, under common and well-founded priors. We do not restrict ourselves to the finite case, showing that in countable structures the results hold if and only if the underlying plausibility ordering is well-founded. We then show that neither well-foundedness nor common priors are expressible in the language commonly used to describe and reason about epistemic-plausibility models. The static (...) agreement result is, however, finitely derivable in an extended modal logic. We provide the full derivation. We finally consider dynamic agreement results. We show they have a counterpart in epistemic-plausibility models, and provide a new form of agreements via public announcements. (shrink)

Bayes' Theorem is a simple mathematical formula used for calculating conditional probabilities. It figures prominently in subjectivist or Bayesian approaches to epistemology, statistics, and inductive logic. Subjectivists, who maintain that rational belief is governed by the laws of probability, lean heavily on conditional probabilities in their theories of evidence and their models of empirical learning. Bayes' Theorem is central to these enterprises both because it simplifies the calculation of conditional probabilities and because it clarifies significant features of subjectivist position. Indeed, (...) the Theorem's central insight — that a hypothesis is confirmed by any body of data that its truth renders probable — is the cornerstone of all subjectivist methodology. (shrink)

Let R be an o-minimal expansion of an ordered group R has no poles, R cannot define a real closed field with domain R and order R is eventually linear and every R -definable set is a finite union of cones. As a corollary we get that Th has quantifier elimination and universal axiomatization in the language with symbols for the ordered group operations, bounded R -definable sets and a symbol for each definable endomorphism of the group.

Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, machine learning (...) results in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (shrink)

The representation theorems of expected utility theory show that having certain types of preferences is both necessary and sufficient for being representable as having subjective probabilities. However, unless the expected utility framework is simply assumed, such preferences are also consistent with being representable as having degrees of belief that do not obey the laws of probability. This fact shows that being representable as having subjective probabilities is not necessarily the same as having subjective probabilities. Probabilism can be defended on (...) the basis of the representation theorems only if attributions of degrees of belief are understood either antirealistically or purely qualitatively, or if the representation theorems are supplemented by arguments based on other considerations (simplicity, consilience, and so on) that single out the representation of a person as having subjective probabilities as the only true representation of the mental state of any person whose preferences conform to the axioms of expected utility theory. (shrink)

Glivenko-type theorems for substructural logics are comprehensively studied in the paper [N. Galatos, H. Ono, Glivenko theorems for substructural logics over FL, Journal of Symbolic Logic 71 1353–1384]. Arguments used there are fully algebraic, and based on the fact that all substructural logics are algebraizable 279–308] and also [N. Galatos, P. Jipsen, T. Kowalski, H. Ono, Residuated Lattices: An Algebraic Glimpse at Substructural Logics, in: Studies in Logic and the Foundations of Mathematics, vol. 151, Elsevier, 2007] for the (...) details). As a complementary work to the algebraic approach developed in [N. Galatos, H. Ono, Glivenko theorems for substructural logics over FL, Journal of Symbolic Logic 71 1353–1384], we present here a concise, proof-theoretic approach to Glivenko theorems for substructural logics. This will show different features of these two approaches. (shrink)

In this paper logics defined by finite Sugihara matrices, as well as RM itself, are discussed both in their matrix (semantical) and in syntactical version. For each such a logic a deduction theorem is proved, and a few applications are given.

In this short survey article, I discuss Bell’s theorem and some strategies that attempt to avoid the conclusion of non-locality. I focus on two that intersect with the philosophy of probability: (1) quantum probabilities and (2) superdeterminism. The issues they raised not only apply to a wide class of no-go theorems about quantum mechanics but are also of general philosophical interest.