“There are no gaps in logical space,” David Lewis writes, giving voice to sentiment shared by many philosophers. But different natural ways of trying to make this sentiment precise turn out to conflict with one another. One is a *pattern* idea: “Any pattern of instantiation is metaphysically possible.” Another is a *cut and paste* idea: “For any objects in any worlds, there exists a world that contains any number of duplicates of all of those objects.” We use resources from model (...) theory to show the inconsistency of certain packages of combinatorial principles and the consistency of others. (shrink)

Two expressive limitations of an infinitary higher-order modal language interpreted on models for higher-order contingentism – the thesis that it is contingent what propositions, properties and relations there are – are established: First, the inexpressibility of certain relations, which leads to the fact that certain model-theoretic existence conditions for relations cannot equivalently be reformulated in terms of being expressible in such a language. Second, the inexpressibility of certain modalized cardinality claims, which shows that in such a language, higher-order contingentists cannot (...) express what is communicated using various instances of talk of ‘possible things’, such as ‘there are uncountably many possible stars’. (shrink)

Informally, structural properties of mathematical objects are usually characterized in one of two ways: either as properties expressible purely in terms of the primitive relations of mathematical theories, or as the properties that hold of all structurally similar mathematical objects. We present two formal explications corresponding to these two informal characterizations of structural properties. Based on this, we discuss the relation between the two explications. As will be shown, the two characterizations do not determine the same class of mathematical properties. (...) From this observation we draw some philosophical conclusions about the possibility of a ‘correct’ analysis of structural properties. (shrink)

Robert Stalnaker has recently advocated propositional contingentism, the claim that it is contingent what propositions there are. He has proposed a philosophical theory of contingency in what propositions there are and sketched a possible worlds model theory for it. In this paper, such models are used to interpret two propositional modal languages: one containing an existential propositional quantifier, and one containing an existential propositional operator. It is shown that the resulting logic containing an existential quantifier is not recursively axiomatizable, as (...) it is recursively isomorphic to second-order logic, and a natural candidate axiomatization for the resulting logic containing an existential operator is shown to be incomplete. (shrink)

This is a survey article on algebraic logic. It gives a historical background leading up to a modern perspective. Central problems in algebraic logic (like the representation problem) are discussed in connection to other branches of logic, like modal logic, proof theory, model-theoretic forcing, finite combinatorics, and Gödel’s incompleteness results. We focus on cylindric algebras. Relation algebras and polyadic algebras are mostly covered only insofar as they relate to cylindric algebras, and even there we have not told the whole story. (...) We relate the algebraic notion of neat embeddings (a notion special to cylindric algebras) to the metalogical ones of provability, interpolation and omitting types in variants of first logic. Another novelty that occurs here is relating the algebraic notion of atom-canonicity for a class of boolean algebras with operators to the metalogical one of omitting types for the corresponding logic. A hitherto unpublished application of algebraic logic to omitting types of first order logic is given. Proofs are included when they serve to illustrate certain concepts. Several open problems are posed. We have tried as much as possible to avoid exploring territory already explored in the survey articles of Monk [93] and Németi [97] in the subject. (shrink)

In this article we provide a mathematical model of Kant?s temporal continuum that satisfies the (not obviously consistent) synthetic a priori principles for time that Kant lists in the Critique of pure Reason (CPR), the Metaphysical Foundations of Natural Science (MFNS), the Opus Postumum and the notes and frag- ments published after his death. The continuum so obtained has some affinities with the Brouwerian continuum, but it also has ‘infinitesimal intervals’ consisting of nilpotent infinitesimals, which capture Kant’s theory of rest (...) and motion in MFNS. While constructing the model, we establish a concordance between the informal notions of Kant?s theory of the temporal continuum, and formal correlates to these notions in the mathematical theory. Our mathematical reconstruction of Kant?s theory of time allows us to understand what ?faculties and functions? must be in place for time to satisfy all the synthetic a priori principles for time mentioned. We have presented here a mathematically precise account of Kant?s transcendental argument for time in the CPR and of the rela- tion between the categories, the synthetic a priori principles for time, and the unity of apperception; the most precise account of this relation to date. We focus our exposition on a mathematical analysis of Kant’s informal terminology, but for reasons of space, most theorems are explained but not formally proven; formal proofs are available in (Pinosio, 2017). The analysis presented in this paper is related to the more general project of developing a formalization of Kant’s critical philosophy (Achourioti & van Lambalgen, 2011). A formal approach can shed light on the most controversial concepts of Kant’s theoretical philosophy, and is a valuable exegetical tool in its own right. However, we wish to make clear that mathematical formalization cannot displace traditional exegetical methods, but that it is rather an exegetical tool in its own right, which works best when it is coupled with a keen awareness of the subtleties involved in understanding the philosophical issues at hand. In this case, a virtuous ?hermeneutic circle? between mathematical formalization and philosophical discourse arises. (shrink)

The pluralist sheds the more traditional ideas of truth and ontology. This is dangerous, because it threatens instability of the theory. To lend stability to his philosophy, the pluralist trades truth and ontology for rigour and other ‘fixtures’. Fixtures are the steady goal posts. They are the parts of a theory that stay fixed across a pair of theories, and allow us to make translations and comparisons. They can ultimately be moved, but we tend to keep them fixed temporarily. Apart (...) from considering rigour of proof as a fixture, I discuss fixed models, invariant notions and fixed information about objects across theories. There are other fixtures, but it is enough to start with these. (shrink)

A dialectical contradiction can be appropriately described within the framework of classical formal logic. It is in harmony with the law of noncontradiction. According to our definition, two theories make up a dialectical contradiction if each of them is consistent and their union is inconsistent. It can happen that each of these two theories has an intended model. Plenty of examples are to be found in the history of science.

In its first meaning, a logic is a collection of closely related artificial languages. There are certain languages called first‐order languages, and together they form first‐order logic. In the same spirit, there are several closely related languages called modal languages, and together they form modal logic. Likewise second‐order logic, deontic logic and so forth.

There is an interesting logical/semantic issue with some mathematical languages and theories. In the language of (pure) complex analysis, the two square roots of i’ manage to pick out a unique object? This is perhaps the most prominent example of the phenomenon, but there are some others. The issue is related to matters concerning the use of definite descriptions and singular pronouns, such as donkey anaphora and the problem of indistinguishable participants. Taking a cue from some work in linguistics and (...) the philosophy of language, I suggest that i functions like a parameter in natural deduction systems. This may require some rethinking of the role of singular terms, at least in mathematical languages. (shrink)

Assuming certain conditions on a class equation image of finitely generated first-order structures admitting the model-theoretical construction of a Fraïssé limit, we characterize retracts of such limits as algebraically closed structures in a class naturally related to equation image. In this way we generalize an earlier description of retracts of the countably infinite random graph.

This paper is a summary of a lecture in which I presented some remarks on Gödel’s incompleteness theorems and their meaning for the foundations of physics. The entire lecture will appear elsewhere. doi: http://dx.doi.org/ 10.5007 / 1808-1711.2011v15n3p453.

Timothy Williamson has argued that in the debate on modal ontology, the familiar distinction between actualism and possibilism should be replaced by a distinction between positions he calls contingentism and necessitism. He has also argued in favor of necessitism, using results on quantified modal logic with plurally interpreted second-order quantifiers showing that necessitists can draw distinctions contingentists cannot draw. Some of these results are similar to well-known results on the relative expressivity of quantified modal logics with so-called inner and outer (...) quantifiers. The present paper deals with these issues in the context of quantified modal logics with generalized quantifiers. Its main aim is to establish two results for such a logic: Firstly, contingentists can draw the distinctions necessitists can draw if and only if the logic with inner quantifiers is at least as expressive as the logic with outer quantifiers, and necessitists can draw the distinctions contingentists can draw if and only if the logic with outer quantifiers is at least as expressive as the logic with inner quantifiers. Secondly, the former two items are the case if and only if all of the generalized quantifiers are first-order definable, and the latter two items are the case if and only if first-order logic with these generalized quantifiers relativizes. (shrink)

In J Philos Logic 34:155–192, 2005, Leitgeb provides a theory of truth which is based on a theory of semantic dependence. We argue here that the conceptual thrust of this approach provides us with the best way of dealing with semantic paradoxes in a manner that is acceptable to a classical logician. However, in investigating a problem that was raised at the end of J Philos Logic 34:155–192, 2005, we discover that something is missing from Leitgeb’s original definition. Moreover, we (...) show that once the appropriate repairs have been made, the resultant definition is equivalent to a version of the supervaluation definition suggested in J Philos 72:690–716, 1975 and discussed in detail in J Symb Log 51(3):663–681, 1986. The upshot of this is a philosophical justification for the simple supervaluation approach and fresh insight into its workings. (shrink)

Everything you always wanted to know about structural realism but were afraid to ask Content Type Journal Article Pages 227-276 DOI 10.1007/s13194-011-0025-7 Authors Roman Frigg, Department of Philosophy, Logic and Scientific Method, London School of Economics and Political Science, Houghton Street, London, WC2A 2AE UK Ioannis Votsis, Philosophisches Institut, Heinrich-Heine-Universität Düsseldorf, Universitätsstraße 1, Geb. 23.21/04.86, 40225 Düsseldorf, Germany Journal European Journal for Philosophy of Science Online ISSN 1879-4920 Print ISSN 1879-4912 Journal Volume Volume 1 Journal Issue Volume 1, Number 2.

Questions about the relation between identity and discernibility are important both in philosophy and in model theory. We show how a philosophical question about identity and dis- cernibility can be ‘factorized’ into a philosophical question about the adequacy of a formal language to the description of the world, and a mathematical question about discernibility in this language. We provide formal definitions of various notions of discernibility and offer a complete classification of their logical relations. Some new and surprising facts are (...) proved; for instance, that weak dis- cernibility corresponds to discernibility in a language with constants for every object, and that weak discernibility is the most discerning nontrivial discernibility relation. (shrink)

Some authors have claimed that ante rem structuralism has problems with structures that have indiscernible places. In response, I argue that there is no requirement that mathematical objects be individuated in a non-trivial way. Metaphysical principles and intuitions to the contrary do not stand up to ordinary mathematical practice, which presupposes an identity relation that, in a sense, cannot be defined. In complex analysis, the two square roots of –1 are indiscernible: anything true of one of them is true of (...) the other. I suggest that ‘i’ functions like a parameter in natural deduction systems. I gave an early version of this paper at a workshop on structuralism in mathematics and science, held in the Autumn of 2006, at Bristol University. Thanks to the organizers, particularly Hannes Leitgeb, James Ladyman, and Øystein Linnebo, to my commentator Richard Pettigrew, and to the audience there. The paper also benefited considerably from a preliminary session at the Arché Research Centre at the University of St Andrews. I am indebted to my colleagues Craige Roberts, for help with the linguistics literature, and Ben Caplan and Gabriel Uzquiano, for help with the metaphysics. Thanks also to Hannes Leitgeb and Jeffrey Ketland for reading an earlier version of the manuscript and making helpful suggestions. I also benefited from conversations with Richard Heck, John Mayberry, Kevin Scharp, and Jason Stanley. CiteULike Connotea Del.icio.us What's this? (shrink)

Visual space can be distinguished from physical space. The first is found in visual experience, while the second is defined independently of perception. Theorists have wondered about the relation between the two. Some investigators have concluded that visual space is non-Euclidean, and that it does not have a single metric structure. Here it is argued that visual space exhibits contraction in all three dimensions with increasing distance from the observer, that experienced features of this contraction are not the same as (...) would be the experience of a perspective projection onto a fronto-parallel plane, and that such contraction is consistent with size constancy. These properties of visual space are different from those that would be predicted if spatial perception resulted from the successful solution of the inverse problem. They are consistent with the notion that optical constraints have been internalized. More generally, they are also consistent with the notion that visual spatial structures bear a resemblance relation to physical spatial structures. This notion supports a type of representational relation that is distinct from mere causal correspondence. The reticence of some philosophers and psychologists to discuss the structure of phenomenal space is diagnosed in terms of the simple materialism and the functionalism of the 1970s and 1980s. (shrink)

We will show that almost all nonassociative relation algebras are symmetric and integral (in the sense that the fraction of both labelled and unlabelled structures that are symmetric and integral tends to $1$ ), and using a Fraïssé limit, we will establish that the classes of all atom structures of nonassociative relation algebras and relation algebras both have $0$ – $1$ laws. As a consequence, we obtain improved asymptotic formulas for the numbers of these structures and broaden some known probabilistic (...) results on relation algebras. (shrink)

This book develops model theory independently of any concrete logical system or structure, within the abstract category-theoretic framework of the so called ‘institution theory’. The development includes most of the important methods and concepts of conventional concrete model theory at the abstract institution-independent level. Consequently it is easily applicable to a rather large diverse collection of logics from the mathematical and computer science practice.

Inquisitive first-order logic, InqBQ, is a system which extends classical first-order logic with formulas expressing questions. From a mathematical point of view, formulas in this logic express properties of sets of relational structures. This paper makes two contributions to the study of this logic. First, we describe an Ehrenfeucht–Fraïssé game for InqBQ and show that it characterizes the distinguishing power of the logic. Second, we use the game to study cardinality quantifiers in the inquisitive setting. That is, we study what (...) statements and questions can be expressed in InqBQ about the number of individuals satisfying a given predicate. As special cases, we show that several variants of the question how many individuals satisfy α(x) are not expressible in InqBQ, both in the general case and in restriction to finite models. (shrink)

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (shrink)

In this paper, we consider some contributions to the model theory of the logic of formal inconsistency $\mathsf{QmbC}$ as a reply to Walter Carnielli, Marcelo Coniglio, Rodrigo Podiacki and Tarcísio Rodrigues’ call for a ‘wider model theory.’ This call demands that we align the practices and techniques of model theory for logics of formal inconsistency as closely as possible with those employed in classical model theory. The key result is a proof that the Keisler–Shelah isomorphism theorem holds for $\mathsf{QmbC}$, i.e. (...) that the strong elementary equivalence of two $\mathsf{QmbC}$ models $\mathfrak{A}$ and $\mathfrak{B}$ is equivalent to them having strongly isomorphic ultrapowers. As intermediate steps, we introduce some notions of model-theoretic equivalence between $\mathsf{QmbC}$ models, explicitly prove Łoś’ theorem and introduce a useful technique of model-theoretic ‘atomization’ in which the satisfaction sets of non-deterministically evaluated formulae are associated with new predicates. Finally, we consider some of the extensions of $\mathsf{QmbC}$, explicitly showing that Keisler–Shelah holds for $\mathsf{QCi}$ and suggesting that it holds of extensions like $\mathsf{QCila}$ and $\mathsf{QCia}$ as well. (shrink)

This article considers the following question: What is the relationship between supervenience and reduction? I investigate this formally: first, by introducing a recent argument by Christian List to the effect that one can have supervenience without reduction; then, by considering how the notion of Nagelian reduction can be related to the formal apparatus of definability and translation theory; then, by showing how, in the context of propositional theories, topological constraints on supervenience serve to enforce reducibility; and, finally, by showing how (...) constraints derived from the theory of ultraproducts can enforce reducibility in the context of first-order theories. (shrink)

Divine necessity is the thesis that God must exist. In this paper, I give a brief survey of what the thesis is more exactly, the main arguments for it, and the main arguments against it.

How does mathematics apply to something non-mathematical? We distinguish between a general application problem and a special application problem. A critical examination of the answer that structural mapping accounts offer to the former problem leads us to identify a lacuna in these accounts: they have to presuppose that target systems are structured and yet leave this presupposition unexplained. We propose to fill this gap with an account that attributes structures to targets through structure generating descriptions. These descriptions are physical descriptions (...) and so there is no such thing as a solely mathematical account of a target system. (shrink)

Suppose that one thinks that certain symmetries of a theory reveal “surplus structure”. What would a formalism without that surplus structure look like? The conventional answer is that it would be a reduced theory: a theory which traffics only in structures invariant under the relevant symmetry. In this paper, I argue that there is a neglected alternative: one can work with a sophisticated version of the theory, in which the symmetries act as isomorphisms.

This paper is a critical response to Andreas Bartels’ sophisticated defense of a structural account of scientific representation. We show that, contrary to Bartels’ claim, homomorphism fails to account for the phenomenon of misrepresentation. Bartels claims that homomorphism is adequate in two respects. First, it is conceptually adequate, in the sense that it shows how representation differs from misrepresentation and non-representation. Second, if properly weakened, homomorphism is formally adequate to accommodate misrepresentation. We question both claims. First, we show that homomorphism (...) is not the right condition to distinguish representation from misrepresentation and non-representation: a “representational mechanism” actually does all the work, and it is independent of homomorphism – as of any structural condition. Second, we test the claim of formal adequacy against three typical kinds of inaccurate representation in science which, by reference to a discussion of the notorious billiard ball model, we define as abstraction, pretence, and simulation. We first point out that Bartels equivocates between homomorphism and the stronger condition of epimorphism, and that the weakened form of homomorphism that Bartels puts forward is not a morphism at all. After providing a formal setting for abstraction, pretence and simulation, we show that for each morphism there is at least one form of inaccurate representation which is not accommodated. We conclude that Bartels’ theory – while logically laying down the weakest structural requirements – is nonetheless formally inadequate in its own terms. This should shed serious doubts on the plausibility of any structural account of representation more generally. (shrink)

We prove several interpolation theorems for many-valued infinitary logic with quantifiers by studying expansions of MV-algebras in the spirit of polyadic and cylindric algebras. We prove for various reducts of polyadic MV-algebras of infinite dimensions that if is the free algebra in the given signature,, is in the subalgebra of generated by, is in the subalgebra of generated by and, then there exists an interpolant in the subalgebra generated by and such that. We call this a varying interpolation property because (...) the integer depends on the inequality. We also address cases where this interpolation property fails, but other weaker ones hold. One such interpolation theorem says that though an interpolant may not be found as above, an interpolant can always be found if finitely many universal quantifiers are applied to making it smaller and the same number of existential quantifiers are applied to making it bigger. This number of quantifiers also varies; it depends on the inequality. Se.. (shrink)

I explore physics implications of the External Reality Hypothesis (ERH) that there exists an external physical reality completely independent of us humans. I argue that with a sufficiently broad definition of mathematics, it implies the Mathematical Universe Hypothesis (MUH) that our physical world is an abstract mathematical structure. I discuss various implications of the ERH and MUH, ranging from standard physics topics like symmetries, irreducible representations, units, free parameters, randomness and initial conditions to broader issues like consciousness, parallel universes and (...) Gödel incompleteness. I hypothesize that only computable and decidable (in Gödel’s sense) structures exist, which alleviates the cosmological measure problem and may help explain why our physical laws appear so simple. I also comment on the intimate relation between mathematical structures, computations, simulations and physical systems. (shrink)

I show that words with indefinite implicit complements occasion a dilemma for their model theory. There has been only two previous attempts to address this problem, one by Fodor and Fodor (1980) and one by Dowty (1981). Each requires that any word tolerating an implicit complement be treated as ambiguous between two different lexical entries and that a meaning postulate or lexical rule be given to constrain suitably the meanings of the various entries for the word. I show that the (...) positing of such an ambiguity runs counter to the facts and propose an alternative solution which does not appeal to ambiguity, meaning postulates or lexical rules. Indeed, I show that the dilemma posed by indefinite implicit complements is posed by all implicit complements and that a general solution to the problem of implicit complements follows from an independently motivated, single treatment of five other problems, that of subcategorization, that of phrasal projections of words, that of defining a model theoretic structure for phrase structure grammars, that of complement polyvalence and that of complement polyadicity. (shrink)

The splitting theorem says that any set of formulae has a finest representation as a family of letter-disjoint sets. Parikh formulated this for classical propositional logic, proved it in the finite case, used it to formulate a criterion for relevance in belief change, and showed that AGMpartial meet revision can fail the criterion. In this paper we make three further contributions. We begin by establishing a new version of the well-known interpolation theorem, which we call parallel interpolation, use it to (...) prove the splitting theorem in the infinite case, and show how AGM belief change operations may be modified, if desired, so as to ensure satisfaction of Parikh’s relevance criterion. (shrink)

It is now part and parcel of the official philosophical wisdom that models are essential to the acquisition and organisation of scientific knowledge. It is also generally accepted that most models represent their target systems in one way or another. But what does it mean for a model to represent its target system? I begin by introducing three conundrums that a theory of scientific representation has to come to terms with and then address the question of whether the semantic view (...) of theories, which is the currently most widely accepted account of theories and models, provides us with adequate answers to these questions. After having argued in some detail that it does not, I conclude by pointing out in what direction a tenable account of scientific representation might be sought. (shrink)

The aim of this article is to strengthen links between cognitive brain research and formal logic. The work covers three fundamental sorts of logical inferences: reasoning in the propositional calculus, i.e. inferences with the conditional “if...then”, reasoning in the predicate calculus, i.e. inferences based on quantifiers such as “all”, “some”, “none”, and reasoning with n-place relations. Studies with brain-damaged patients and neuroimaging experiments indicate that such logical inferences are implemented in overlapping but different bilateral cortical networks, including parts of the (...) fronto-temporal cortex, the posterior parietal cortex, and the visual cortices. I argue that these findings show that we do not use a single deterministic strategy for solving logical reasoning problems. This account resolves many disputes about how humans reason logically and why we sometimes deviate from the norms of formal logic. (shrink)

The aim of this paper is to introduce the notion of a game for intuitionistic first-order Kripke models. We also establish links between notions presented here and the notions of logical equivalence and bounded bisimulation for intuitionistic first-order Kripke models, and the Ehrenfeucht–Fraïssé game for classical first-order structures.

We prove that the minimal Logic of Formal Inconsistency $\mathsf{QmbC}$ validates a weaker version of Fraïssé’s theorem. LFIs are paraconsistent logics that relativize the Principle of Explosion only to consistent formulas. Now, despite the recent interest in LFIs, their model-theoretic properties are still not fully understood. Our aim in this paper is to investigate the situation. Our interest in FT has to do with its fruitfulness; the preservation of FT indicates that a number of other classical semantic properties can be (...) also salvaged in LFIs. Further, given that FT depends on truth-functionality, whether full FT holds for $\mathsf{QmbC}$ becomes a challenging question. (shrink)

I review the philosophical literature on the question of when two physical theories are equivalent. This includes a discussion of empirical equivalence, which is often taken to be necessary, and sometimes taken to be sufficient, for theoretical equivalence; and “interpretational” equivalence, which is the idea that two theories are equivalent just in case they have the same interpretation. It also includes a discussion of several formal notions of equivalence that have been considered in the recent philosophical literature, including (generalized) definitional (...) equivalence and categorical equivalence. The article concludes with a brief discussion of the relationship between equivalence and duality. The article is in two parts; this is Part 2, which addresses categorical equivalence, interpretational equivalence, and duality. (shrink)

In the literature over the Ramsey-sentence approach to structural realism, there is often debate over whether structural realists can legitimately restrict the range of the second-order quantifiers, in order to avoid the Newman problem. In this paper, I argue that even if they are allowed to, it won’t help: even if the Ramsey sentence is interpreted using such restricted quantifiers, it is still an implausible candidate to capture a theory’s structural content. To do so, I use the following observation: if (...) a Ramsey sentence did encode a theory’s structural content, then two theories would be structurally equivalent just in case they have logically equivalent Ramsey sentences. I then argue that this criterion for structural equivalence is implausible, even where frame or Henkin semantics are used. (shrink)

In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like CPV and PV1. We use the mentioned results to obtain some independence results in the context of intuitionistic bounded arithmetic. We show that, if the intuitionistic theory of polynomial induction (...) on strict $\Pi_2^{b}$ formulas proves decidability of $\Sigma_1^b$ formulas, then P=NP. We also prove that, if the mentioned intuitionistic theory proves ${\rm LMIN}(\Sigma_{1}^{b})$ , then P=NP. (shrink)

We analyze and compare geometrical theories based on mereology (mereogeometries). Most theories in this area lack in formalization, and this prevents any systematic logical analysis. To overcome this problem, we concentrate on specific interpretations for the primitives and use them to isolate comparable models for each theory. Relying on the chosen interpretations, we introduce the notion of environment structure, that is, a minimal structure that contains a (sub)structure for each theory. In particular, in the case of mereogeometries, the domain of (...) an environment structure is composed of particular subsets of Rn. The comparison of mereogeometrical theories within these environment structures shows dependencies among primitives and provides (relative) definitional equivalences. With one exception, we show that all the theories considered are equivalent in these environment structures. (shrink)

This paper concerns Carnap’s early contributions to formal semantics in his work on general axiomatics between 1928 and 1936. Its main focus is on whether he held a variable domain conception of models. I argue that interpreting Carnap’s account in terms of a fixed domain approach fails to describe his premodern understanding of formal models. By drawing attention to the second part of Carnap’s unpublished manuscript Untersuchungen zur allgemeinen Axiomatik, an alternative interpretation of the notions ‘model’, ‘model extension’ and ‘submodel’ (...) in his theory of axiomatics is presented. Specifically, it is shown that Carnap’s early model theory is based on a convention to simulate domain variation that is not identical but logically comparable to the modern account. (shrink)

We survey various aspects of the problem of automatic continuity of homomorphisms between Polish groups.

The notion of strict identity is sometimes given an explicit second-order definition: objects with all the same properties are identical. Here, a somewhat different problem is raised: Under what conditions is the identity relation on the domain of a structure first-order definable? A structure may have objects that are distinct, but indiscernible by the strongest means of discerning them given the language (the indiscernibility formula). Here a number of results concerning the indiscernibility formula, and the definability of identity, are collected (...) and a number of applications discussed. (shrink)

The paper aims to develop a resemblance theory of properties that technically improves on past versions. The theory is based on a comparative resemblance predicate. In combination with other resources, it solves the various technical problems besetting resemblance nominalism. The paper’s second main aim is to indicate that previously proposed resemblance theories that solve the technical problems, including the comparative theory, are nominalistically unacceptable and have controversial philosophical commitments.

I review the philosophical literature on the question of when two physical theories are equivalent. This includes a discussion of empirical equivalence, which is often taken to be necessary, and sometimes taken to be sufficient, for theoretical equivalence; and “interpretational” equivalence, which is the idea that two theories are equivalent just in case they have the same interpretation. It also includes a discussion of several formal notions of equivalence that have been considered in the recent philosophical literature, including (generalized) definitional (...) equivalence and categorical equivalence. The article concludes with a brief discussion of the relationship between equivalence and duality. The article is in two parts; this is Part 1, which addresses empirical equivalence and definitional equivalence. (shrink)

We define a new type of “shatter function” for set systems that satisfies a Sauer–Shelah type dichotomy, but whose polynomial-growth case is governed by Shelah’s two-rank instead of VC dimension. We identify the least exponent bounding the rate of growth of the shatter function, the quantity analogous to VC density, with Shelah’s $\omega $ -rank.