We provide a sucient frame-theoretic condition for a super bi-intuitionistic logic to have Maksimova's variable separation property. We conclude that bi-intuitionistic logic enjoys the property. Furthermore, we offer an algebraic characterization of the super-bi-intuitionistic logics with Maksimova's property.

Syntactic approaches in the philosophy of science, which are based on formalizations in predicate logic, are often considered in principle inferior to semantic approaches, which are based on formalizations with the help of structures. To compare the two kinds of approach, I identify some ambiguities in common semantic accounts and explicate the concept of a structure in a way that avoids hidden references to a specific vocabulary. From there, I argue that contrary to common opinion (i) unintended models do not (...) pose a significant problem for syntactic approaches to scientific theories, (ii) syntactic approaches can be at least as language-independent as semantic ones, and (iii) in syntactic approaches, scientific theories can be as well connected to the world as in semantic ones. Based on these results, I argue that syntactic and semantic approaches fare equally well when it comes to (iv) ease of application, (v) accommodating the use of models in the sciences, and (vi) capturing the theory-observation relation. (shrink)

Category mistakes are sentences such as ‘Colourless green ideas sleep furiously’ or ‘The theory of relativity is eating breakfast’. Such sentences are highly anomalous, and this has led a large number of linguists and philosophers to conclude that they are meaningless (call this ‘the meaninglessness view’). In this paper I argue that the meaninglessness view is incorrect and category mistakes are meaningful. I provide four arguments against the meaninglessness view: in Sect. 2, an argument concerning compositionality with respect to category (...) mistakes; in Sect. 3 an argument concerning synonymy facts of category mistakes; in Sect. 4 concerning embeddings of category mistakes in propositional attitude ascriptions; and in Sect. 5 concerning the uses of category mistakes in metaphors. Having presented these arguments, in Sect. 6 I briefly discuss some of the positive motivations for accepting the meaninglessness view and argue that they are unconvincing. I conclude that the meaninglessness view ought to be rejected. (shrink)

The papers you will find in this special issue of JoLLI develop letter and spirit of Turing’s original contributions. They do not lazily fall back into the same old sofa, but follow – or question – the inspiring ideas of a great man in the search for new, more precise, conclusions. It is refreshing to know that the fertile landscape created by Alan Turing remains a source of novel ideas.

The diagnostic category of borderline personality disorder (BPD) has come under increasing criticism in recent years. In this paper, we analyze the role and impact of epistemic injustice, specifically testimonial injustice, in relation to the diagnosis of BPD. We first offer a critical sociological and historical account, detailing and expanding a range of arguments that BPD is problematic nosologically. We then turn to explore the epistemic injustices that can result from a BPD diagnosis, showing how they can lead to experiences (...) of testimonial injustice which impede patient engagement in meaning-making activities, thereby undermining standard therapeutic goals. We conclude by showing how our arguments bolster ongoing efforts to replace the diagnostic category of BPD with alternatives such as complex post-traumatic stress disorder. (shrink)

It is a metaphysical orthodoxy that interesting non-symmetric relations cannot be reduced to symmetric ones. This orthodoxy is wrong. I show this by exploring the expressive power of symmetric theories, i.e. theories which use only symmetric predicates. Such theories are powerful enough to raise the possibility of Pythagrapheanism, i.e. the possibility that the world is just a vast, unlabelled, undirected graph.

Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...) potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. (shrink)

This paper is concerned with counterfactual logic and its implications for the modal status of mathematical claims. It is most directly a response to an ambitious program by Yli-Vakkuri and Hawthorne (2018), who seek to establish that mathematics is committed to its own necessity. I claim that their argument fails to establish this result for two reasons. First, their assumptions force our hand on a controversial debate within counterfactual logic. In particular, they license counterfactual strengthening— the inference from ‘If A (...) were true then C would be true’ to ‘If A and B were true then C would be true’—which many reject. Second, the system they develop is provably equivalent to appending Deduction Theorem to a T modal logic. It is unsurprising that the combination of Deduction Theorem with T results in necessitation; indeed, it is precisely for this reason that many logicians reject Deduction Theorem in modal contexts. If Deduction Theorem is unacceptable for modal logic, it cannot be assumed to derive the necessity of mathematics. (shrink)

This paper presents a simple pair of first-order theories that are not definitionally (nor Morita) equivalent, yet are mutually conservatively translatable and mutually 'surjectively' translatable. We use these results to clarify the overall geography of standards of equivalence and to show that the structural commitments that theories make behave in a more subtle manner than has been recognized.

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.

Jaakko Hintikka points out the power of Skolem functions to affect both what there is and what we know. There is a tension in his presupposition that these functions actually extend the realm of logic. He claims to have resolved the tension by “reconstructing constructivism” along epistemological lines, instead of by a typical ontological construction; however, after the collapse of the distinction between first and second order, that resolution is not entirely satisfactory. Still, it does throw light on the conceptual (...) analysis Hintikka proposes. (shrink)

Mathematicians, physicists, and philosophers of physics often look to the symmetries of an object for insight into the structure and constitution of the object. My aim in this paper is to explain why this practice is successful. In order to do so, I present a collection of results that are closely related to (and in a sense, generalizations of) Beth’s and Svenonius’ theorems.

This essay accounts for the notion of _Lebensform_ by assigning it a _logical _role in Wittgenstein’s later philosophy. Wittgenstein’s additions of the notion to his manuscripts of the _PI_ occurred during the initial drafting of the book 1936-7, after he abandoned his effort to revise _The Brown Book_. It is argued that this constituted a substantive step forward in his attitude toward the notion of simplicity as it figures within the notion of logical analysis. Next, a reconstruction of his later (...) remarks on _Lebensformen_ is offered which factors in his reading of Alan Turing’s “On computable numbers, with an application to the _Entscheidungsproblem_“, as well as his discussions with Turing 1937-1939. An interpretation of the five occurrences of _Lebensform_ in the PI is then given in terms of a logical “regression” to _Lebensform_ as a fundamental notion. This regression characterizes Wittgenstein’s mature answer to the question, “What is the nature of the logical?”. (shrink)

Khoussainov and Nerode [14] posed various open questions on model-theoretic properties of automatic structures. In this work we answer some of these questions by showing the following results: There is an uncountably categorical but not countably categorical theory for which only the prime model is automatic; There are complete theories with exactly 3,4,5,…3,4,5,… countable models, respectively, and every countable model is automatic; There is a complete theory for which exactly 2 models have an automatic presentation; If LOGSPACE=PLOGSPACE=P then there is (...) an uncountably categorical but not countably categorical theory for which the prime model does not have an automatic presentation but all the other countable models are automatic; There is a complete theory with countably many countable models for which the saturated model has an automatic presentation but the prime model does not have one. (shrink)

We show the non-arithmeticity of 1st order theories of lattices of Σ n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithmetic theories than has been previously known, and of the lattice of degrees of interpretability over PA. The first two results are applications of Nies’ theorem on the non-arithmeticity of the 1st order theory of the lattice of r.e. ideals on any effectively dense r.e. Boolean algebra. The theorem on degrees of (...) interpretability relies on an adaptation of techniques leading to Nies’ theorem. (shrink)

There are several known Lindström-style characterization results for basic modal logic. This paper proves a generic Lindström theorem that covers any normal modal logic corresponding to a class of Kripke frames definable by a set of formulas called strict universal Horn formulas. The result is a generalization of a recent characterization of modal logic with the global modality. A negative result is also proved in an appendix showing that the result cannot be strengthened to cover every first-order elementary class of (...) frames. This is shown by constructing an explicit counterexample. (shrink)

By operations on models we show how to relate completeness with respect to permissivenominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal models, so the construction hinges on generating from an instance of the latter, some instance of the former in which sufficiently many inequalities are preserved between elements. We do this using an infinite generalisation of nominal atoms-abstraction. The results are of interest in their own right, (...) but also, we factor the mathematics so as to maximise the chances that it could be used off-the-shelf for other nominal reasoning systems too. Models with infinite support can be easier to work with, so it is useful to have a semi-automatic theorem to transfer results from classes of infinitely-supported nominal models to the more restricted class of models with finite support. In conclusion, we consider different permissive-nominal syntaxes and nominal models and discuss how they relate to the results proved here. (shrink)

In his classic 1936 essay "On the Concept of Logical Consequence", Alfred Tarski used the notion of satisfaction to give a semantic characterization of the logical properties. Tarski is generally credited with introducing the model-theoretic characterization of the logical properties familiar to us today. However, in his book, The Concept of Logical Consequence, Etchemendy argues that Tarski's account is inadequate for quite a number of reasons, and is actually incompatible with the standard model-theoretic account. Many of his criticisms are meant (...) to apply to the model-theoretic account as well. In this paper, I discuss the following four critical charges that Etchemendy makes against Tarski and his account of the logical properties: (1) (a) Tarski's account of logical consequence diverges from the standard model-theoretic account at points where the latter account gets it right. (b) Tarski's account cannot be brought into line with the model-theoretic account, because the two are fundamentally incompatible. (2) There are simple counterexamples (enumerated by Etchemendy) which show that Tarski's account is wrong. (3) Tarski committed a modal fallacy when arguing that his account captures our pre-theoretical concept of logical consequence, and so obscured an essential weakness of the account. (4) Tarski's account depends on there being a distinction between the "logical terms" and the "non-logical terms" of a language, but (according to Etchemendy) there are very simple (even first-order) languages for which no such distinction can be made. Etchemendy's critique raises historical and philosophical questions about important foundational work. However, Etchemendy is mistaken about each of these central criticisms. In the course of justifying that claim, I give a sustained explication and defense of Tarski's account. Moreover, since I will argue that Tarski's account and the model theoretic account really do come to the same thing, my subsequent defense of Tarski's account against Etchemendy's other attacks doubles as a defense against criticisms that would apply equally to the familiar model-theoretic account of the logical properties. (shrink)

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.

This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excellence, which is a key to the structure theory of uncountable models. The notion of Abstract Elementary Class arose naturally in attempting to prove the categoricity theorem for L ω 1 ,ω (Q). More recently, Zilber has attempted to identify canonical mathematical structures as those whose theory (in an appropriate logic) (...) is categorical in all powers. Zilber's trichotomy conjecture for first order categorical structures was refuted by Hrushovski, by the introducion of a special kind of Abstract Elementary Class. Zilber uses a powerful and essentailly infinitary variant on these techniques to investigate complex exponentiation. This not only demonstrates the relevance of Shelah's model theoretic investigations to mainstream mathematics but produces new results and conjectures in algebraic geometry. (shrink)

This paper is devoted to the problem of existence of saturated models for first-order many-valued logics. We consider a general notion of type as pairs of sets of formulas in one free variable that express properties that an element of a model should, respectively, satisfy and falsify. By means of an elementary chains construction, we prove that each model can be elementarily extended to a $\kappa $-saturated model, i.e. a model where as many types as possible are realized. In order (...) to prove this theorem we obtain, as by-products, some results on tableaux (understood as pairs of sets of formulas) and their consistency and satisfiability and a generalization of the Tarski–Vaught theorem on unions of elementary chains. Finally, we provide a structural characterization of $\kappa $-saturation in terms of the completion of a diagram representing a certain configuration of models and mappings. (shrink)

The article puts forward a branching-style framework for the analysis of determinism and indeterminism of scientific theories, starting from the core idea that an indeterministic system is one whose present allows for more than one alternative possible future. We describe how a definition of determinism stated in terms of branching models supplements and improves current treatments of determinism of theories of physics. In these treatments, we identify three main approaches: one based on the study of equations, one based on mappings (...) between temporal realizations, and one based on branching models. We first give an overview of these approaches and show that current orthodoxy advocates a combination of the mapping- and the equations-based approaches. After giving a detailed formal explication of a branching-based definition of determinism, we consider three concrete applications and end with a formal comparison of the branching- and the mapping-based approach. We conclude that the branching-based definition of determinism most usefully combines formal clarity, connection with an underlying philosophical notion of determinism, and relevance for the practical assessment of theories. 1 Introduction2 Determinism in Philosophy of Science: Three Approaches2.1 Determinism: The core idea and how to spell it out2.2 The three approaches in more detail2.3 Representing indeterminism3 Orthodoxy: DMAP, with Invocations of DEQN4 Branching-Style Determinism 4.1 Models and realizations4.2 Faithfulness4.3 Two types of branching topologies 5 Comparing the Approaches5.1 Case studies5.2 Formal comparison of the DMAP and DBRN frameworks6 Conclusions. (shrink)

Abstract.We use a model theoretic approach to investigate properties of local-global principles for positive primitive formulas in spaces of orderings, such as the existence of bounds and the axiomatizability of local-global principles. As a consequence we obtain various classes of special groups satisfying local-global principles for all positive primitive formulas, and we show that local-global principles are preserved by some natural constructions in special groups.

In this study, several proofs of the compactness theorem for propositional logic with countably many atomic sentences are compared. Thereby some steps are taken towards a systematic philosophical study of the compactness theorem. In addition, some related data and morals for the theory of mathematical explanation are presented.

Throughout the development of finite model theory, the fragments of first-order logic with only finitely many variables have played a central role. This survey gives an introduction to the theory of finite variable logics and reports on recent progress in the area.For each k ≥ 1 we let Lk be the fragment of first-order logic consisting of all formulas with at most k variables. The logics Lk are the simplest finite-variable logics. Later, we are going to consider infinitary variants and (...) extensions by so-called counting quantifiers.Finite variable logics have mostly been studied on finite structures. Like the whole area of finite model theory, they have interesting model theoretic, complexity theoretic, and combinatorial aspects. For finite structures, first-order logic is often too expressive, since each finite structure can be characterized up to isomorphism by a single first-order sentence, and each class of finite structures that is closed under isomorphism can be characterized by a first-order theory. The finite variable fragments seem to be promising candidates with the right balance between expressive power and weakness for a model theory of finite structures. This may have motivated Poizat [67] to collect some basic model theoretic properties of the Lk. Around the same time Immerman [45] showed that important complexity classes such as polynomial time or polynomial space can be characterized as collections of all classes of finite structures definable by uniform sequences of first-order formulas with a fixed number of variables and varying quantifier-depth. (shrink)

Analogues of Scott's isomorphism theorem, Karp's theorem as well as results on lack of compactness and strong completeness are established for infinitary propositional relevant logics. An "interpolation theorem" for the infinitary quantificational boolean logic L-infinity omega. holds. This yields a preservation result characterizing the expressive power of infinitary relevant languages with absurdity using the model-theoretic relation of relevant directed bisimulation as well as a Beth definability property.

A calculus of names is a logical theory describing relations between names. By a pure calculus of names we mean a quantifier-free formulation of such a theory, based on classical propositional calculus. An axiomatisation of a pure calculus of names is presented and its completeness is discussed. It is shown that the axiomatisation is complete in three different ways: with respect to a set theoretical model, with respect to Leśniewski's Ontology and in a sense defined with the use of axiomatic (...) rejection. The independence of axioms is proved. A decision procedure based on syntactic transformations and models defined in the domain of only two members is defined. (shrink)

Quine often argued for a simple, untyped system of logic rather than the typed systems that were championed by Russell and Carnap, among others. He claimed that nothing important would be lost by eliminating sorts, and the result would be additional simplicity and elegance. In support of this claim, Quine conjectured that every many-sorted theory is equivalent to a single-sorted theory. We make this conjecture precise, and prove that it is true, at least according to one reasonable notion of theoretical (...) equivalence. Our clarification of Quine’s conjecture, however, exposes the shortcomings of his argument against many-sorted logic. (shrink)

Following a result by De Rijke for modal logic, it is shown that the basic weak entailment model-theoretic language with absurdity is the maximal model-theoretic language having the finite occurrence property, preservation under relevant directed bisimulations and the finite depth property. This can be seen as a generalized preservation theorem characterizing propositional weak entailment formulas among formulas of other model-theoretic languages.

We describe the progress of model theory in the last half century from the standpoint of how finite model theory might develop.

Truth diagrams are introduced as a novel graphical representation for propositional logic. To demonstrate their epistemic efficacy a set of 28 concepts are proposed that any comprehensive representation for PL should encompass. TDs address all the criteria whereas seven other existing representations for PL only provide partial coverage. These existing representations are: the linear formula notation, truth tables, a PL specific interpretation of Venn Diagrams, Frege’s conceptual notation, diagrams from Wittgenstein’s Tractatus, Pierce’s alpha graphs and Gardner’s shuttle diagrams. The comparison (...) of the representations succeeds in distinguishing ideas that are fundamental to PL from features of common PL representations that are somewhat arbitrary. (shrink)

A homogenizable structure M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {M}$$\end{document} is a structure where we may add a finite number of new relational symbols to represent some ∅-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\emptyset-$$\end{document}definable relations in order to make the structure homogeneous. In this article we will divide the homogenizable structures into different classes which categorize many known examples and show what makes each class important. We will show that model completeness is vital (...) for the relation between a structure and the amalgamation bases of its age and give a necessary and sufficient condition for an ω-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega-$$\end{document}categorical model-complete structure to be homogenizable. (shrink)

Dans la philosophie de Hintikka la notion d'analyticité occupe une place particulière (e.g., [Hintikka 1973], [Hintikka 2007]) ; plus précisément, le philosophe finnois distingue deux notions d'analyticité : l'une qui est basée sur la notion d'information, l'autre sur la notion de preuve. Alors que ces deux notions ont été largement utilisées pour étudier la logique propositionnelle et la logique du premier ordre, aucun travail n'a été développé pour la logique modale. Cet article se propose de combler cette lacune et ainsi (...) d'examiner l'analyticité des validités de la logique modale. (shrink)

This paper exhibits a general and uniform method to prove axiomatic completeness for certain modal fixpoint logics. Given a set Γ of modal formulas of the form γ, where x occurs only positively in γ, we obtain the flat modal fixpoint language by adding to the language of polymodal logic a connective γ for each γΓ. The term γ is meant to be interpreted as the least fixed point of the functional interpretation of the term γ. We consider the following (...) problem: given Γ, construct an axiom system which is sound and complete with respect to the concrete interpretation of the language on Kripke structures. We prove two results that solve this problem.First, let be the logic obtained from the basic polymodal by adding a Kozen–Park style fixpoint axiom and a least fixpoint rule, for each fixpoint connective γ. Provided that each indexing formula γ satisfies a certain syntactic criterion, we prove this axiom system to be complete.Second, addressing the general case, we prove the soundness and completeness of an extension of . This extension is obtained via an effective procedure that, given an indexing formula γ as input, returns a finite set of axioms and derivation rules for γ, of size bounded by the length of γ. Thus the axiom system is finite whenever Γ is finite. (shrink)

On the 27th of October, 1949, the Department of Philosophy at the University of Manchester organized a symposium "Mind and Machine", as Michael Polanyi noted in his Personal Knowledge (1974, p. 261). This event is known, especially among scholars of Alan Turing, but it is scarcely documented. Wolfe Mays (2000) reported about the debate, which he personally had attended, and paraphrased a mimeographed document that is preserved at the Manchester University archive. He forwarded a copy to Andrew Hodges and B. (...) Jack Copeland, who in then published it on their respective websites. The basis of this interpretation here is the copy preserved in the Regenstein Library of the University of Chicago, Special Collections, Polanyi Collection (abbreviated RPC, box 22, folder 19). The same collection holds the mimeographed statement that Polanyi prepared for this symposium: "Can the mind be represented by a machine?" This text has not been studied by Polanyi scholars. (shrink)

The authors believe that the questions raised at the beginning of Frege’s On Sense and Reference – ‘Is [identity] a relation? A relation between objects, or between names or signs of objects?’ – set the course for a long-lasting but not at all satisfying discussion. For the disputants tend to advocate, either a ‘name-view’ of identity in a straightforward but rudimentary and logically untenable form, or else a version of an ‘object-view’ that makes all too light of the analysandum–analysans distinction (...) and hence is damned to analytical barrenness. In contrast, by unfolding the underlying idea of the original ‘name-view’, the authors offer three alternative and mutually compatible interpretations of identity that may best be characterized as the ‘name-based’, the ‘hybrid’ and the ‘sense-based’ variant of a ‘concept-view of identity’. At the same time, however, these interpretations may well be considered variants of a non-barren ‘object-view’. (shrink)

The purported fact that geometric theories formulated in terms of points and geometric theories formulated in terms of lines are “equally correct” is often invoked in arguments for conceptual relativity, in particular by Putnam and Goodman. We discuss a few notions of equivalence between first-order theories, and we then demonstrate a precise sense in which this purported fact is true. We argue, however, that this fact does not undermine metaphysical realism.

Recently logic has shifted emphasis from static systems developed for purely theoretical reasons to dynamic systems designed for application to real world situations. The emphasis on the applied aspects of logic and reasoning means that logic has become a pragmatic tool, to be judged against the backdrop of a particular application. This shift in emphasis is, however, not new. A similar shift towards “interactive logic” occurred in the high Middle Ages. We provide a number of different examples of “interactive logic” (...) in the Middle Ages, all species of the disputation game obligatio. These games display a recognition of the importance of interaction in logical contexts and the way that interactive logic differs from single-agent inference. (shrink)

We show that the N₀-categorical structures produced by Hrushovski's predimension construction with a control function fit neatly into Shelah's $SOP_n $ hierarchy: if they are not simple, then they have SOP₃ and NSOP₄. We also show that structures produced without using a control function can be undecidable and have SOP.

The processing of sequences of (English) sentences is analyzedcompositionally through transitions that merge sentences, rather thandecomposing them. Transitions that are in a precise senseinertial are related to disjunctive and non-deterministic approaches toambiguity. Modal interpretations are investigated, inducing variousequivalences on sequences.

We construct a stable one-based, trivial theory with a reduct which is not trivial. This answers a question of John B. Goode. Using this, we construct a stable theory which is n-ample for all natural numbers n, and does not interpret an infinite group.

We study the expansion of stable structures by adding predicates for arbitrary subsets. Generalizing work of Poizat-Bouscaren on the one hand and Baldwin-Benedikt-Casanovas-Ziegler on the other we provide a sufficient condition (Theorem 4.7) for such an expansion to be stable. This generalization weakens the original definitions in two ways: dealing with arbitrary subsets rather than just submodels and removing the 'small' or 'belles paires' hypothesis. We use this generalization to characterize in terms of pairs, the 'triviality' of the geometry on (...) a strongly minimal set (Theorem 2.5). Call a set A benign if any type over A in the expanded language is determined by its restriction to the base language. We characterize the notion of benign as a kind of local homogenity (Theorem 1.7). Answering a question of [8] we characterize the property that M has the finite cover property over A (Theorem 3.9). (shrink)

This paper contains portions of Baldwin’s talk at the Set Theory and Model Theory Conference and a detailed proof that in a suitable extension of ZFC, there is a complete sentence of \ that has maximal models in cardinals cofinal in the first measurable cardinal and, of course, never again.

The paper describes two approaches to determinism: one focuses on the features of global objects, such as possible worlds or models of a theory, whereas the other’s concern is the possible behaviour of individual objects. It then gives an outline of an individuals-based analysis of the determinism of theories. Finally, a general relativistic spacetime with non-isometric extensions is described and used to illustrate a conflict between the two approaches: this spacetime is indeterministic by the first approach but deterministic by the (...) second approach. (shrink)

Glymour and Quine propose two different formal criteria for theoretical equivalence. In this paper we examine the relationships between these criteria.

Let V be a finite relational vocabulary in which no symbol has arity greater than 2. Let be countable V‐structure which is homogeneous, simple and 1‐based. The first main result says that if is, in addition, primitive, then it is strongly interpretable in a random structure. The second main result, which generalizes the first, implies (without the assumption on primitivity) that if is “coordinatized” by a set with SU‐rank 1 and there is no definable (without parameters) nontrivial equivalence relation on (...) M with only finite classes, then is strongly interpretable in a random structure. (shrink)

For simplicity, most of the literature introduces the concept of definitional equivalence only to languages with disjoint signatures. In a recent paper, Barrett and Halvorson introduce a straightforward generalization to languages with non-disjoint signatures and they show that their generalization is not equivalent to intertranslatability in general. In this paper,we show that their generalization is not transitive and hence it is not an equivalence relation. Then we introduce the Andréka and Németi generalization as one of the many equivalent formulations for (...) languages with disjoint signatures. We show that the Andréka-Németi generalization is the smallest equivalence relation containing the Barrett–Halvorson generalization and it is equivalent to intertranslatability even for languages with non-disjoint signatures. Finally,we investigate which definitions for definitional equivalences remain equivalent when we generalize them for theories with non-disjoint signatures. (shrink)