Logic and Philosophy of Logic, Miscellaneous

It is widely assumed that the identity relation is, among other things, transitive. Some have proposed that the identity relation might hold between objects contingently or occasionally. If, on those proposals, identity is shown to not be transitive, then there is reason to reject such proposals. One such argument attempts to show that the identity relation on such proposals violates transitivity in cases of 'simultaneous' fissions and fusion. I argue that, even in those cases, contingent identity and occasional identity are (...) transitive. (shrink)

We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let Ω be a regular uncountable cardinal. Let m < ω and M be an m-sound premouse and Σ be...

A wide Aronszajn tree is a tree of size and height $\omega _{1}$ with no uncountable branches. We prove that under $MA$ there is no wide Aronszajn tree which is universal under weak embeddings. This solves an open question of Mekler and Väänänen from 1994. We also prove that under $MA$, every wide Aronszajn tree weakly embeds in an Aronszajn tree, which combined with a result of Todorčević from 2007, gives that under $MA$ every wide Aronszajn tree embeds into a (...) Lipschitz tree or a coherent tree. We also prove that under $MA$ there is no wide Aronszajn tree which weakly embeds all Aronszajn trees, improving the result in the first paragraph as well as a result of Todorčević from 2007 who proved that under $MA$ there are no universal Aronszajn trees. (shrink)

This paper aims to argue for, else illustrate the epistemological significance of the use of non transitive similarity relations, mapping only to "types", as methodologically being on a par with the use of transitive similarity relations (equivalence relations), mapping as well to "predicates". -/- In this paper the sketch of an exact but simple geometrical model of the above construct is followed by mentioning respective use cases for non transitive similarity relations from science and humanities. A well known metaphysics example (...) is elaborated along these lines to some extent. (shrink)

El estudio actual de la argumentación se encuentra distanciado de la lógica. En este artículo sostengo que restaurar el vínculo del estudio de la argumentación con esta disciplina podría resultar benéfico para la metas descriptivas y normativas de este campo de investigación. Tras destacar algunos aspectos del surgimiento la teoría de la argumentación contemporánea, enfatizando la idea de "perspectivas", explico cómo el reconocimiento de sus objetivos y tareas volvió problemática la coexistencia de varios enfoques o aproximaciones para el estudio de (...) la realidad argumentativa. Sugiero algunas hipótesis explicativas sobre el abandono del enfoque lógico en favor de otras alternativas y, a continuación, ofrezco razones para encauzar el estudio sistemático de la argumentación desde este enfoque. Además de las consideraciones normativas y las herramientas descriptivas que pueden aducirse en su favor, sostengo que el enfoque lógico puede proporcionar una clase de integración a este campo investigación de maneras que no están disponibles para otras aproximaciones. (shrink)

In ordinary language, in the medical sciences, and in the overlap between them, we frequently make claims which imply that we might have had different gametic origins from the ones we actually have. Such statements seem intuitively true and coherent. But they counterfactually ascribe different DNA to their referents and therefore contradict material-origin essentialism, which Kripke and his followers argue is intuitively obvious. In this paper I argue, using examples from ordinary language and from philosophy of medicine and bioethics, that (...) statements which attribute alternative material origins to their referents are useful, common in political and medical reasoning, and in many cases best interpreted literally. So we must replace the doctrine of material-origin essentialism with one that can make sense of ordinary discourse and the language of the medical sciences. I propose an anti-essentialist account of such counterfactuals according to which individuals’ modal properties are relative to a given inquiry. (shrink)

In 1932, von Neumann proposed classifying the statistical behavior of differentiable systems. Joint work of B. Weiss and the author proved that the classification problem is complete analytic. Based on techniques in that proof, one is able to show that the collection of recursive diffeomorphisms of the 2-torus that are isomorphic to their inverses is $\Pi ^0_1$-hard via a computable 1-1 reduction. As a corollary there is a diffeomorphism that is isomorphic to its inverse if and only if the Riemann (...) Hypothesis holds, a different one that is isomorphic to its inverse if and only if Goldbach’s conjecture holds and so forth. Applying the reduction to the $\Pi ^0_1$-sentence expressing “ZFC is consistent” gives a diffeomorphism T of the 2-torus such that the question of whether $T\cong T^{-1}$ is independent of ZFC. (shrink)

The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality -- these are the so-called "dangerous" directed graphs. Building on Rabern, et. al (2013) we reformulate this problem in terms of fixed points of certain functions, thereby boiling it down to get (...) a purely mathematical problem. (shrink)

We give a short proof of the fundamental theorem of central element theory. The original proof is constructive and very involved and relies strongly on the fact that the class be a variety. Here we give a more direct nonconstructive proof which applies for the more general case of a first-order class which is both closed under the formation of direct products and direct factors.

If ${\mathfrak {F}}$ is a type-definable family of commensurable subsets, subgroups or subvector spaces in a metric structure, then there is an invariant subset, subgroup or subvector space commensurable with ${\mathfrak {F}}$. This in particular applies to type-definable or hyper-definable objects in a classical first-order structure.

Consider a definably complete uniformly locally o-minimal expansion of the second kind of a densely linearly ordered abelian group. Let $f:X \rightarrow R^n$ be a definable map, where X is a definable set and R is the universe of the structure. We demonstrate the inequality $\dim ) \leq \dim $ in this paper. As a corollary, we get that the set of the points at which f is discontinuous is of dimension smaller than $\dim $. We also show that the (...) structure is definably Baire in the course of the proof of the inequality. (shrink)

In connection with the work of Anscombe, Macpherson, Steinhorn and the present author in [1] we investigate the notion of a multidimensional exact class, a special kind of multidimensional asymptotic class with measuring functions that yield the exact sizes of definable sets, not just approximations. We use results about smooth approximation [24] and Lie coordinatization [13] to prove the following result, as conjectured by Macpherson: For any countable language $\mathcal {L}$ and any positive integer d the class $\mathcal {C}$ of (...) all finite $\mathcal {L}$-structures with at most d 4-types is a polynomial exact class in $\mathcal {L}$, where a polynomial exact class is a multidimensional exact class with polynomial measuring functions. (shrink)

Предложен е семантичен подход към логиката, в рамките на какъвто е вид дискурс, отличим със своята тавтологичност. На тази основа е даден пример и сравнение с психоаналитичен (Фройдистки) дискурс.

We present three examples of countable homogeneous structures whose automorphism groups are not universal, namely, fail to contain isomorphic copies of all automorphism groups of their substructures.Our first example is a particular case of a rather general construction on Fraïssé classes, which we call diversification, leading to automorphism groups containing copies of all finite groups. Our second example is a special case of another general construction on Fraïssé classes, the mixed sums, leading to a Fraïssé class with all finite symmetric (...) groups appearing as automorphism groups and at the same time with a torsion-free automorphism group of its Fraïssé limit. Our last example is a Fraïssé class of finite models with arbitrarily large finite abelian automorphism groups, such that the automorphism group of its Fraïssé limit is again torsion-free. (shrink)

We study a partial order on countably complete ultrafilters introduced by Ketonen [2] as a generalization of the Mitchell order. The following are our main results: the order is wellfounded; its linearity is equivalent to the Ultrapower Axiom, a principle introduced in the author’s dissertation [1]; finally, assuming the Ultrapower Axiom, the Ketonen order coincides with Lipschitz reducibility in the sense of generalized descriptive set theory.

There is a Turing computable embedding $\Phi $ of directed graphs $\mathcal {A}$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform effective interpretation; i.e., for all directed graphs $\mathcal {A}$, these formulas interpret $\mathcal {A}$ in $\Phi $. It follows that $\mathcal {A}$ is Medvedev reducible to $\Phi $ uniformly; i.e., $\mathcal {A}\leq _s\Phi $ with a fixed Turing operator that serves for all $\mathcal {A}$. We observe that there is a graph G (...) that is not Medvedev reducible to any linear ordering. Hence, G is not effectively interpreted in any linear ordering. Similarly, there is a graph that is not interpreted in any linear ordering using computable $\Sigma _2$ formulas. Any graph can be interpreted in a linear ordering using computable $\Sigma _3$ formulas. Friedman and Stanley [4] gave a Turing computable embedding L of directed graphs in linear orderings. We show that there is no fixed tuple of $L_{\omega _1\omega }$ -formulas that, for all G, interpret the input graph G in the output linear ordering $L$. Harrison-Trainor and Montalbán [7] have also shown this, by a quite different proof. (shrink)

In this paper we investigate the computational complexity of deciding if the variety generated by a given finite idempotent algebra satisfies a special type of Maltsev condition that can be specified using a certain kind of finite labelled path. This class of Maltsev conditions includes several well known conditions, such as congruence permutability and having a sequence of n Jónsson terms, for some given n. We show that for such “path defined” Maltsev conditions, the decision problem is polynomial-time solvable.

We prove that the homeomorphism relation between compact spaces can be continuously reduced to the homeomorphism equivalence relation between absolute retracts, which strengthens and simplifies recent results of Chang and Gao, and Cieśla. It follows then that the homeomorphism relation of absolute retracts is Borel bireducible with the universal orbit equivalence relation. We also prove that the homeomorphism relation between regular continua is classifiable by countable structures and hence it is Borel bireducible with the universal orbit equivalence relation of the (...) permutation group on a countable set. On the other hand we prove that the homeomorphism relation between rim-finite metrizable compacta is not classifiable by countable structures. (shrink)

Answering one of the main questions of [S.-D. Friedman, T. Hyttinen and V. Kulikov, Generalized descriptive set theory and classification theory, Mem. Amer. Math. Soc. 230 80, Chap. 7], we show that there is a tight connection between the depth of a classifiable shallow theory [Formula: see text] and the Borel rank of the isomorphism relation [Formula: see text] on its models of size [Formula: see text], for [Formula: see text] any cardinal satisfying [Formula: see text]. This is achieved by (...) establishing a link between said rank and the [Formula: see text]-Scott height of the [Formula: see text]-sized models of [Formula: see text], and yields to the following descriptive set-theoretical analog of Shelah’s Main Gap Theorem: Given a countable complete first-order theory [Formula: see text], either [Formula: see text] is Borel with a countable Borel rank, or it is not Borel at all. The dividing line between the two situations is the same as in Shelah’s theorem, namely that of classifiable shallow theories. We also provide a Borel reducibility version of the above theorem, discuss some limitations to the possible complexities of [Formula: see text], and provide a characterization of categoricity of [Formula: see text] in terms of the descriptive set-theoretical complexity of [Formula: see text]. (shrink)

We study a family of ultraproducts of finite fields with the Frobenius automorphism in this paper. Their theories have the strict order property and TP2. But the coarse pseudofinite dimension of the definable sets is definable and integer-valued. Moreover, we also discuss the possible connection between coarse dimension and transformal transcendence degree in these difference fields.

Hermann Weyl was one of the greatest mathematicians of the 20th century, with contributions to many branches of mathematics and physics. In 1918 he wrote a famous book, “Das Kontinuum”, on the foundations of mathematics. In that book he described mathematical analysis as a ‘house built on sand’, and tried to ‘replace this shifting foundation with pillars of enduring strength’. In this paper we reexamine and explain the philosophical and mathematical ideas that underly Weyl’s system in “Das Kontinuum”, and show (...) that they are still useful and relevant. We propose a precise formalization of that system, which is the first to be completely faithful to what is written in the book. Finally, we suggest that a certain set-theoretical modern system reflects better Weyl’s ideas than previous attempts (most notably by Feferman) of achieving this goal. (shrink)

Consider the following three claims. (i) There are no truths of the form ‘p and ~p’. (ii) No one holds a belief of the form ‘p and ~p’. (iii) No one holds any pairs of beliefs of the form {p, ~p}. Irad Kimhi has recently argued, in effect, that each of these claims holds and holds with metaphysical necessity. Furthermore, he maintains that they are ultimately not distinct claims at all, but the same claim formulated in different ways. I find (...) his argument suggestive, if not entirely transparent. I do think there is at least an important kernel of truth even in (iii), and that (i) ultimately explains what’s right about the other two. Consciousness of an impossibility makes belief in the obtaining of the corresponding state of affairs an impossibility. Interestingly, an appreciation of this fact brings into view a novel conception of inference, according to which it consists in the consciousness of necessity. This essay outlines and defends this position. A central element of the defense is that it reveals how reasoners satisfy what Paul Boghossian calls the Taking Condition and do so without engendering regress. (shrink)

This thesis is about the metaphysics of logic. I argue against a view I refer to as ‘logical realism’. This is the view that the logical constants represent a particular kind of metaphysical structure, which I dub ‘logico-metaphysical structure’. I argue instead for a more metaphysically lightweight view of logic which I dub ‘logical expressivism’. -/- In the first part of this thesis (Chapters I and II) I argue against a number of arguments that Theodore Sider has given for logical (...) realism. In Chapter I, I present an argument of his to the effect that logico-metaphysical structure provides the only good explanation of the semantic determinacy of the logical constants. I argue that other explanations are possible. In Chapter II, I present another argument of his to the effect that logico-metaphysical structure is something that comes along with ontological realism: the view that there is a non-language-relative fact of the matter about what exists. I argue that the connection between logical and ontological realism is not as close as Sider makes it out to be. -/- In the second part of this thesis (Chapters III – V) I set out a positive view of the logical constants that can explain both why their meanings are semantically determinate, and why they form part of our vocabulary. On that view, the primary bearers of logical structure are propositional attitudes, and the logical constants are in our language as vehicles for the expression of logically complex propositional attitudes. In Chapter III, I set out an expressivist theory of propositional logic. In Chapter IV, I use this theory to explain how the logical connectives end up having determinate meanings. In Chapter V, I extend the expressivist theory to predicate logic. (shrink)

A series of nonrepresentable relation algebras is constructed from groups. We use them to prove that there are continuum many subvarieties between the variety of representable relation algebras and the variety of coset relation algebras. We present our main construction in terms of polygroupoids.

Mantık, yirminci yüzyıldaki gelişimi bakımından ele alındığında, matematik, bilgisayar bilimi, dilbilim ve felsefe gibi alanlarla sıkı kavramsal bağlantılar kuran bir disiplin haline gelmiştir. Tüm bu alanların gündelik dilde izi sürülen anlamalar, anlaşmalar, anlatmalar vb. edimler için birşeyler söyleyebileceğini ya da yapabileceğini varsayabiliriz. Ancak bu varsayım gündelik dilin mantığıyla ya da mantıksızlıklarıyla doğrudan başedebilecek bir anlama yetisi kazanmanın kolay bir yolu olduğu anlamına gelmez. Modern mantık matematikseldir ve gündelik dilde bir kolaylık sağlamaz; aksine işleri olduğundan da karmaşık hale getirir.

Reism or concretism are the labels for a position in ontology and semantics that is represented by various philosophers. As Kazimierz Ajdukiewicz and Jan Woleński have shown, there are two dimensions with which the abstract expression of reism can be made concrete: The ontological dimension of reism says that only things exist; the semantic dimension of reism says that all concepts must be reduced to concrete terms in order to be meaningful. In this paper we argue for the following two (...) theses: (1) Arthur Schopenhauer has advocated a reistic philosophy of language which says that all concepts must ultimately be based on concrete intuition in order to be meaningful. (2) In his semantics, Schopenhauer developed a theory of logic diagrams that can be interpreted by modern means in order to concretize the abstract position of reism. Thus we are not only enhancing Jan Woleński’s list of well-known reists, but we are also adding a diagrammatic dimension to concretism, represented by Schopenhauer. (shrink)

"It’s a beautiful thing, the destruction of words. Of course the great wastage is in the verbs and adjectives, but there are hundreds of nouns that can be got rid of as well. It isn’t only the synonyms; there are also the antonyms. After all, what justification is there for a word which is simply the opposite of some other word? A word contains its opposite in itself. Take “good”, for instance. If you have a word like “good”, what need (...) is there for a word like “bad”? “Ungood” will do just as well — better, because it’s an exact opposite, which the other is not." (Syme, in George Orwell's Nineteen Eighty-Four) -/- This chapter is about opposites and Newspeak in Orwell's Nineteen Eighty-Four. (shrink)

The logic of indicative conditionals remains the topic of deep and intractable philosophical disagreement. I show that two influential epistemic norms—the Lockean theory of belief and the Ramsey test for conditional belief—are jointly sufficient to ground a powerful new argument for a particular conception of the logic of indicative conditionals. Specifically, the argument demonstrates, contrary to the received historical narrative, that there is a real sense in which Stalnaker’s semantics for the indicative did succeed in capturing the logic of the (...) Ramseyan indicative conditional. (shrink)

Any logic is represented as a certain collection of well-orderings admitting or not some algebraic structure such as a generalized lattice. Then universal logic should refer to the class of all subclasses of all well-orderings. One can construct a mapping between Hilbert space and the class of all logics. Thus there exists a correspondence between universal logic and the world if the latter is considered a collection of wave functions, as which the points in Hilbert space can be interpreted. The (...) correspondence can be further extended to the foundation of mathematics by set theory and arithmetic, and thus to all mathematics. (shrink)

State spaces are, in the most general sense, sets of entities that contain information. Examples include states of dynamical systems, processes of observations, or possible worlds. We use domain theory to describe the structure of positive and negative information in state spaces. We present examples ranging from the space of trajectories of a dynamical system, over Dunn’s aboutness interpretation of fde, to the space of open sets of a spectral space. We show that these information structures induce so-called hype models (...) which were recently developed by Leitgeb. Conversely, we prove a representation theorem: roughly, hype models can be represented as induced by an information structure. Thus, the well-behaved logic hype is a sound and complete logic for reasoning about information in state spaces. As application of this framework, we investigate information fusion. We motivate two kinds of fusion. We define a groundedness and a separation property that allow a hype model to be closed under the two kinds of fusion. This involves a Dedekind–MacNeille completion and a fiber-space like construction. The proof-techniques come from pointless topology and universal algebra. (shrink)

We prove the following instance of a conjecture stated in [P. E. Eleftheriou and Y. Peterzil, Definable quotients of locally definable groups, Selecta Math. 18 885–903]. Let [Formula: see text] be an abelian semialgebraic group over a real closed field [Formula: see text] and let [Formula: see text] be a semialgebraic subset of [Formula: see text]. Then the group generated by [Formula: see text] contains a generic set and, if connected, it is divisible. More generally, the same result holds when (...) [Formula: see text] is definable in any o-minimal expansion of [Formula: see text] which is elementarily equivalent to [Formula: see text]. We observe that the above statement is equivalent to saying: there exists an [Formula: see text] such that [Formula: see text] is an approximate subgroup of [Formula: see text]. (shrink)

We initiate the study of definable [Formula: see text]-topologies and show that there is at most one such [Formula: see text]-topology on a [Formula: see text]-henselian NIP field. Equivalently, we show that if [Formula: see text] is a bi-valued NIP field with [Formula: see text] henselian, then [Formula: see text] and [Formula: see text] are comparable. As a consequence, Shelah’s conjecture for NIP fields implies the henselianity conjecture for NIP fields. Furthermore, the latter conjecture is proved for any field admitting (...) a henselian valuation with a dp-minimal residue field. We conclude by showing that Shelah’s conjecture is equivalent to the statement that any NIP field not contained in the algebraic closure of a finite field is [Formula: see text]-henselian. (shrink)

Cases or examples can be often explained by the interplay of arguments in favour or against their outcomes. This paper addresses the problem of finding explanations for a collection of cases where an explanation is a labelled argumentation graph consistent with the cases, and a case is represented as a statement labelling. The focus is on semi-abstract argumentation graphs specifying attack and subargument relations between arguments, along with particular complete argument labellings taken from probabilistic argumentation where arguments can be excluded. (...) The framework and computational considerations lead to an iterated local iterative deepening depth-first search to collect ‘interesting’ semi-abstract argumentation graphs consistent with a collection of statement labellings. Finally, the framework is illustrated and evaluated with a proof-of-concept implementation. (shrink)

Inspired by recent work on proof theory for modal logic, this paper develops a cut-free labelled sequent calculus obtained by imitating Herzberger’s limit rule for revision sequences as a clause in a possible world semantics. With the help of two completeness theorems, one between the labelled sequent calculus and the corresponding possible world semantics, and one between the axiomatic theory of truth PosFS and a neighbourhood semantics, together with the proof of the equivalence between the two semantics, we show that (...) the theory of truth obtained with the labelled sequent calculus based on Herzberger’s limit rule is equivalent to PosFS. (shrink)

This article provides a computational example of a mathematical explanation within science, concerning computational equivalence of programs. In addition, it outlines the logical structure of the reasoning involved in explanations in applied mathematics. It concludes with a challenge that the nominalist provide a nominalistic explanation for the computational equivalence of certain programs.

(1) This paper is about how to build an account of the normativity of logic around the claim that logic is constitutive of thinking. I take the claim that logic is constitutive of thinking to mean that representational activity must tend to conform to logic to count as thinking. (2) I develop a natural line of thought about how to develop the constitutive position into an account of logical normativity by drawing on constitutivism in metaethics. (3) I argue that, while (...) this line of thought provides some insights, it is importantly incomplete, as it is unable to explain why we should think. I consider two attempts at rescuing the line of thought. The first, unsuccessful response is that it is self-defeating to ask why we ought to think. The second response is that we need to think. But this response secures normativity only if thinking has some connection to human flourishing. (4) I argue that thinking is necessary for human flourishing. Logic is normative because it is constitutive of this good. (5) I show that the resulting account deals nicely with problems that vex other accounts of logical normativity. (shrink)

This paper deals with the possibility of an incarnation in the feminine in our age. In the first part, we discuss sexual genealogies in ancient Israel and address the problem of the extreme vulnerability of feminine life in the midst of an ancient sacrificial crisis. The second part opens with an analysis of Feuerbach’s interpretation of the Trinity. The triadic logic, as found within various religious contexts, is also affirmed. Based on our analyses from the first and the second part, (...) in the third part, we address the problems of feminine vulnerability and fragility on one hand, and triadic thinking on the other hand, and relate them to an original proposal for the future matrixial theology of incarnation. (shrink)

The standard Leibnizian view of identity allows for substitutivity of identicals and validates transitivity of identity within classical semantics. However, in a series of works, Graham Priest argues that Leibnizian identity invalidates both principles when formalized in paraconsistent semantics. This paper aims to show the Leibnizian view of identity validates substitutivity of identicals and transitivity of identity whether the logic is classical or paraconsistent. After presenting Priest's semantics of identity, I show what a semantic expression of Leibnizian identity does amount (...) to. Then, I argue that Priest's semantic definition of identity is not Leibnizian. Finally, I offer a semantics characterization of identity in paraconsistent logic that is truly Leibnizian. I demonstrate that the correct formalization of Leibnizian identity in paraconsistent logic also validates substitutivity of identicals and transitivity of identity. (shrink)

A formal sequent system dealing with Menelaus' configurations is introduced in this paper. The axiomatic sequents of the system stem from 2-cycles of Δ-complexes. The Euclidean and projective interpretations of the sequents are defined and a soundness result is proved. This system is decidable and its provable sequents deliver incidence results. A cyclic operad structure tied to this system is presented by generators and relations.

I propose an account of indicative conditionals that combines features of minimal change semantics and information semantics. As in information semantics, conditionals are interpreted relative to an information state in accordance with the Ramsey test idea: “if p then q” is supported at a state s iff q is supported at the hypothetical state s[p] obtained by restricting s to the p-worlds. However, information states are not modeled as simple sets of worlds, but by means of a Lewisian system of (...) spheres. Worlds in the inner sphere are considered possible; worlds outside of it are ruled out, but to different degrees. In this way, even when a state supports “not p”, it is still possible to suppose p consistently. I argue that this account does better than its predecessors with respect to a set of desiderata concerning inferences with conditionals. In particular, it captures three important facts: that a conditional is logically independent from its antecedent; that a sequence of antecedents behaves like a single conjunctive antecedent ; and that conditionals restrict the quantification domain of epistemic modals. I also discuss two ways to construe the role of a premise, and propose a generalized notion of entailment that keeps the two apart. (shrink)

The main purpose of this paper is to investigate various notions of empirical equivalence in relation to the two main arguments for realism in the philosophy of science, namely the no-miracles argument and the indispensability argument. According to realism, one should believe in the existence of the theoretical entities postulated by empirically adequate theories. According to the no-miracles argument, one should do so because truth is the the best explanation of empirical adequacy. According to the indispensability argument, one should do (...) so because the theoretical terms employed in the formulation of an empirically adequate theory are practically indispensable for the formulation of its empirical content. The no-miracles argument might be refuted if one can establish an underdetermination thesis to the effect that every theory has empirically equivalent rivals that are incompatible with each other. Insofar as truth cannot explain the empirical adequacy of two incompatible theories, there is an obvious conflict between the underdetermination thesis and the no-miracles argument. I show that, under certain assumptions, some but not all notions of empirical equivalence support the underdetermination thesis. The indispensability argument might be refuted if one can establish a dispensability thesis to the effect that, for any theory with a practical formulation, there is an empirically equivalent theory with a practical formulation in purely empirical terms. I show that some but not all notions of empirical equivalence support this thesis. (shrink)

We present an elementary system of axioms for the geometry of Minkowski spacetime. It strikes a balance between a simple and streamlined set of axioms and the attempt to give a direct formalization in first-order logic of the standard account of Minkowski spacetime in [Maudlin 2012] and [Malament, unpublished]. It is intended for future use in the formalization of physical theories in Minkowski spacetime. The choice of primitives is in the spirit of [Tarski 1959]: a predicate of betwenness and a (...) four place predicate to compare the square of the relativistic intervals. Minkowski spacetime is described as a four dimensional ‘vector space’ that can be decomposed everywhere into a spacelike hyperplane - which obeys the Euclidean axioms in [Tarski and Givant, 1999] - and an orthogonal timelike line. The length of other ‘vectors’ are calculated according to Pythagora’s theorem. We conclude with a Representation Theorem relating models of our system that satisfy second order continuity to the mathematical structure called ‘Minkowski spacetime’ in physics textbooks. (shrink)