A first-order sentence is quasi-modal if its class of models is closed under the modal validity preserving constructions of disjoint unions, inner substructures and bounded epimorphic images. It is shown that all members of the proper class of canonical structures of a modal logic Λ have the same quasi-modal first-order theory Ψ Λ . The models of this theory determine a modal logic Λ e which is the largest sublogic of Λ to be determined by an elementary class. The (...) canonical structures of Λ e also have Ψ Λ as their quasi-modal theory. In addition there is a largest sublogic Λ c of Λ that is determined by its canonical structures, and again the canonical structures of Λ c have Ψ Λ are their quasi-modal theory. Thus Ψ Λ = Ψ Λ c = Ψ Λ e . Finally, we show that all finite structures validating Λ are models of Ψ Λ , and that if Λ is determined by its finite structures, then Ψ Λ is equal to the quasi-modal theory of these structures. (shrink)

In [2], Bar-Hillel, Gaifman, and Shamir prove that the simple phrase structure grammars dened by Chomsky are equivalent in a cer- tain sense to Bar-Hillel's bidirectional categorial grammars . On the other hand, Cohen [3] proves the equivalence of the latter ones to what he calls free categorial grammars . They are closely related to Lambek's syntactic calculus which is, in turn, based on the idea due to Ajdukiewicz [1]. For some reasons, Cohen's proof seems to be at least (...) in- complete. Here, I give a short outline of the direct proof of the equivalence between SF G's and F CG's. (shrink)

A first-order sentence isquasi-modalif its class of models is closed under the modal validity preserving constructions of disjoint unions, inner substructures and bounded epimorphic images.It is shown that all members of the proper class of canonical structures of a modal logicΛhave the same quasi-modal first-order theoryΨΛ. The models of this theory determine a modal logicΛewhich is the largest sublogic ofΛto be determined by an elementary class. The canonical structures ofΛealso haveΨΛas their quasi-modal theory.In addition there is a largest (...) sublogicΛeofΛthat is determined by its canonical structures, and again the canonical structures ofΛehaveΨΛare their quasi-modal theory. Thus. Finally, we show that all finite structures validatingΛare models ofΨΛ, and that ifΛis determined by its finite structures, thenΨΛis equal to the quasi-modal theory of these structures. (shrink)

A standard line in the contemporary philosophical literature has it that physical theories are equivalent only when they agree on their empirical content, where this empirical content is often understood as being encoded in the equations of motion of those theories. In this article, we question whether it is indeed the case that the empirical content of a theory is exhausted by its equations of motion, showing that (for example) considerations of boundary conditions play a key role in the empirical (...) equivalence (or otherwise) of theories. Having argued for this, we show that philosophical claims made by Weatherall (2016) that electromagnetism in the Faraday tensor formalism is equivalent to electromagnetism in the vector potential formalism, and by Knox (2011) that general relativity is equivalent to teleparallel gravity, can both be called into question. We then show that properly considering the role of boundary conditions in theory structure can potentially restore these claims of equivalence and close with some remarks on the pragmatics of adjudications on theory identity. (shrink)

This paper is based on Lectures 1, 2 and 4 in the series of ten lectures titled “Algebraic Structures for Logic” that Professor Blok and I presented at the Twenty Third Holiday Mathematics Symposium held at New Mexico State University in Las Cruces, New Mexico, January 8-12, 1999. These three lectures presented a new approach to the algebraization of deductive systems, and after the symposium we made plans to publish a joint paper, to be written by Blok, further developing (...) these ideas. That project was still incomplete when Blok died. In fact, there is no indication that he had prepared a draft of the paper, and we do not know what new material he intended to include. I am therefore not in a position to complete the project as he had envisioned it. So, I have settled for the more limited objective of presenting the material from the three lectures, leaving to others the task of adapting the techniques used there to more general situations. (shrink)

In [2], Bar-Hillel, Gaifman, and Shamir prove that the simple phrase structure grammars (SPGs) defined by Chomsky are equivalent in a certain sense to Bar-Hillel's bidirectional categorial grammars (BCGs). On the other hand, Cohen [3] proves the equivalence of the latter ones to what the calls free categorial grammars (FCGs). They are closely related to Lambek's syntactic calculus which, in turn, is based on the idea due to Ajdukiewicz [1]. For the reasons which will be discussed in the last (...) section, Cohen's proof seems to be at least incomplete. This paper yields a direct proof of the equivalence ofFCGs andSPGs. (shrink)

This paper argues that the theory of structured propositions is not undermined by the Russell-Myhill paradox. I develop a theory of structured propositions in which the Russell-Myhill paradox doesn't arise: the theory does not involve ramification or compromises to the underlying logic, but rather rejects common assumptions, encoded in the notation of the $\lambda$-calculus, about what properties and relations can be built. I argue that the structuralist had independent reasons to reject these underlying assumptions. The theory is given both a (...) diagrammatic representation, and a logical representation in a novel language. In the latter half of the paper I turn to some technical questions concerning the treatment of quantification, and demonstrate various equivalences between the diagrammatic and logical representations, and a fragment of the $\lambda$-calculus. (shrink)

With catastrophic events of «nature» like global warming, arguments emerge that insinuate an equivalence of vulnerability, responsibility or being affected by these catastrophes. Such an alleged equivalence when facing climate catastrophe is already visible, for example, in the notion of the «Anthropocene» itself, which obscures both causes and various vulnerabilities in a homogenized as well as universalized concept of humanity (anthropos). Taking such narratives as a starting point, the paper explores questions about the connection between catastrophe, temporality, and (...) history, following mainly Walter Benjamin, Dipesh Chakrabarty and Jean-Luc Nancy with the goal to provide (1) a critique of the concept «Anthropocene» on the basis of nonequivalence while retaining its key features to still grasp the catastrophic present, (2) an analysis of anthropocenic time and the chronical structure of catastrophe, (3) philosophical considerations on the intersection of catastrophe and history. (shrink)

We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have the same expressive power. On infinite structures however, the question whether there is a formula in IFP not equivalent to any LFP-formula was left open.In this paper, we answer the question negatively, i.e. we show that the two logics are equally expressive on arbitrary structures. We give a syntactic translation of (...) IFP-formulae to LFP-formulae such that the two formulae are equivalent on all structures.As a consequence of the proof we establish a close correspondence between the LFP-alternation hierarchy and the IFP-nesting depth hierarchy. We also show that the alternation hierarchy for IFP collapses to the first level, i.e. the complement of any inflationary fixed point is itself an inflationary fixed point. (shrink)

In this article, I give a counterexample to a claim made in that empirically equivalent theories can often be regarded as theoretically equivalent by treating one as having surplus structure, thereby overcoming the problem of underdetermination of theory choice. The case I present is that of Lorentz's ether theory and Einstein's theory of special relativity. I argue that Norton's suggestion that surplus structure is present in Lorentz's theory in the form of the ether state of rest is based on a (...) misunderstanding of the role that the ether plays in Lorentz's theory, and that in general, consideration of the conceptual framework in which a theory is embedded is vital to understanding the relationship between different theories. (shrink)

We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theories are always decidable. We then show that, under some hypotheses, the map sending an L-structure R to the L-structure of definable functions from R n to R preserves elementary inclusions and equivalences and gives a structure with a decidable theory whenever R is decidable. We briefly consider structures of definable functions satisfying an extra (...) condition such as continuity. (shrink)

Let D be a division ring such that the number of conjugacy classes of the multiplicative group D ∗ is equal to the power of D ∗ . Suppose that H is the group GL or PGL, where V is a vector space of infinite dimension ϰ over D . We prove, in particular, that, uniformly in κ and D , the first-order theory of H is mutually syntactically interpretable with the theory of the two-sorted structure 〈κ,D〉 in the second-order (...) logic with quantification over arbitrary relations of power ⩽κ . A certain analogue of this results is proved for the groups ΓL and PΓL . These results imply criteria of elementary equivalence for infinite-dimensional classical groups of types H= ΓL , PΓL , GL, PGL over division rings, and solve, for these groups, a problem posed by U. Felgner. It follows from the criteria that if H≡H then κ 1 and κ 2 are second-order equivalent as sets. (shrink)

We continue the work of Blok and Jónsson by developing the theory of structural closure operators and introducing the notion of a representation between them. Similarities and equivalences of Blok-Jónsson turn out to be bijective representations and bijective structural representations, respectively. We obtain a characterization for representations induced by a transformer. In order to obtain a similar characterization for structural representations we introduce the notions of a graduation and a graded variable of an M-set. We show that several deductive systems, (...) Gentzen systems among them, are graded M-sets having graded variables, and describe the graded variables in each case. In the last section we show that, for a sentential logic, having an algebraic semantics is equivalent to being representable in an equational consequence. This motivates the extension of the notion of having an algebraic semantics for Gentzen systems, hypersequents systems, etc. We prove that if a closure operator is representable by a transformer, then every extension of it is also representable by the same transformer. As a consequence we obtain that if one of these systems has an algebraic semantics, then so does any of its extensions with the same defining equations. (shrink)

The desirability relation was introduced by Isbell to qualitatively compare the a priori influence of voters in a simple game. In this paper, we extend this desirability relation to simple games with coalition structure. In these games, players organize themselves into a priori disjoint coalitions. It appears that the desirability relation defined in this paper is a complete preorder in the class of swap-robust games. We also compare our desirability relation with the preorders induced by the generalizations to games with (...) coalition structure of the Shapley–Shubik and Banzhaf–Coleman power indices Values of games with a priori unions, 1977; Owen, Power, voting and voting power. In: Holler MJ Modification of the Banzhaf–Coleman index for games with a priori unions, 1981). It happens that in general they are different even if one considers the subclass of weighed voting games. However, if structural coalitions have equal size then both Owen–Banzhaf and the desirability preordering coincide. (shrink)

We introduce a new framework for classifying logics on finite structures and studying their expressive power. This framework is based on the concept of almost everywhere equivalence of logics, that is to say, two logics having the same expressive power on a class of asymptotic measure 1. More precisely, if L, L ′ are two logics and μ is an asymptotic measure on finite structures, then $\scr{L}\equiv _{\text{a.e.}}\scr{L}^{\prime}(\mu)$ means that there is a class C of finite (...) class='Hi'>structures with μ (C)=1 and such that L and L ′ define the same queries on C. We carry out a systematic investigation of $\equiv _{\text{a.e.}}$ with respect to the uniform measure and analyze the $\equiv _{\text{a.e.}}$ -equivalence classes of several logics that have been studied extensively in finite model theory. Moreover, we explore connections with descriptive complexity theory and examine the status of certain classical results of model theory in the context of this new framework. (shrink)

In a seminal paper, Aumann (1987, Econometrica 55, 1–18) showed how the choices of rational players could be analyzed in a unified state space framework. His innovation was to include the choices of the players in the description of the states, thus abolishing Savage’s (1954, The Foundations of Statistics. Wiley, New York) distinction between acts and consequences. But this simplification comes at a price: Aumann’s notion of Bayes rationality does not allow players to evaluate what would happen were they to (...) deviate from their actual choices. We show how the addition of a causal structure to the framework enables us to analyze such counterfactual statements, and use it to introduce a notion of causal rationality. Under a plausible causal independence condition, the two notions are shown to be equivalent. If we are prepared to accept this condition we can dispense with the causal apparatus and retain Aumann’s original framework. (shrink)

The richness of humanity is the diversity of its cultures, but now as never before the destructive power of modern technology and threatening ecological disasters make it necessary that we all recognize we are many peoples of one world. Complementing the diversity of our different cultures, the growth of a common, scientific knowledge inspires the hope that we may achieve and share a secondary culture of ideas. Computers, which can help represent explicitly the best ideas of modern science, can aid (...) in the diffusion of such powerful ideas to create a popular, secondary, scientific culture.We propose that a primary objective of learning environment design should be the development of thinkable models in the minds of students; further, since thinkable models represent a level of knowledge deeper than superficial terminology and specific graphical forms, such may be an objective suitable for various people in different cultures. To pursue these notions in some detail, a taxonomy of models is developed and the issue of how representations relate to human modes of perception and action is raised. The notions are explored first through the contrasting of a half-dozen approaches to the Pythagorean Theorem; then through describing polylingual word worlds and the Rosetta disk project.Common experiences produce common models —not only public models but the cognitive structures built from those shared experiences; and shared models will permit enhanced communication and understanding. If sharing experiences through play with computer based learning environments in different languages permits children to develop common models of the world, this will ultimately enhance mutual understanding between people in different places. This objective is now within reach. (shrink)

Political sociologists interested in corporate power have focused increasingly on the extent to which the business community is cohesive. Studies of cohesion, however, frequently contain either no definition or operational definitions with little theoretical rationale. This paper examines the uses of the term cohesion in the power structure literature as well as in classical and contemporary sociological theory. I argue that: (1) cohesion is most appropriately defined as an objective characteristic of a social structure; (2) to understand a group's power, (...) we should focus on the extent to which its members behave similarly; and (3) the concept of structural equivalence may be as likely to capture the processes of interest to power structure researchers as the concept of cohesion. Findings from a study of corporate political behavior are presented to illustrate this argument. (shrink)

In [8], the third author defined a reducibility$\le _w^{\rm{*}}$that lets us compare the computing power of structures of any cardinality. In [6], the first two authors showed that the ordered field of reals${\cal R}$lies strictly above certain related structures. In the present paper, we show that$\left \equiv _w^{\rm{*}}{\cal R}$. More generally, for the weak-looking structure${\cal R}$ℚconsisting of the real numbers with just the ordering and constants naming the rationals, allo-minimal expansions of${\cal R}$ℚare equivalent to${\cal R}$. Using this, we (...) show that for any analytic functionf,$\left \equiv _w^{\rm{*}}{\cal R}$. $is noto-minimal.). (shrink)

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, \ bi-embeddable categoricity, and degrees of bi-embeddable categoricity. These notions mirror the classical notions used to study the complexity of isomorphisms between structures. We show that the notions of \ bi-embeddable categoricity and relative \ bi-embeddable categoricity coincide for equivalence structures for \. We also prove that computable equivalence structures have degree of bi-embeddable categoricity (...) \, or \. We furthermore obtain results on the index set complexity of computable equivalence structure with respect to bi-embeddability. (shrink)

After discussing the limitations inherent to all set-theoretic reflection principles akin to those studied by A. Lévy et. al. in the 1960s, we introduce new principles of reflection based on the general notion of Structural Reflection and argue that they are in strong agreement with the conception of reflection implicit in Cantor’s original idea of the unknowability of the Absolute, which was subsequently developed in the works of Ackermann, Lévy, Gödel, Reinhardt, and others. We then present a comprehensive survey of (...) results showing that different forms of the new principle of Structural Reflection are equivalent to well-known large cardinal axioms covering all regions of the large-cardinal hierarchy, thereby justifying the naturalness of the latter. (shrink)

This Element explores what it means for two theories in physics to be equivalent, and what lessons can be drawn about their structure as a result. It does so through a twofold approach. On the one hand, it provides a synoptic overview of the logical tools that have been employed in recent philosophy of physics to explore these topics: definition, translation, Ramsey sentences, and category theory. On the other, it provides a detailed case study of how these ideas may be (...) applied to understand the dynamical and spatiotemporal structure of Newtonian mechanics - in particular, in light of the symmetries of Newtonian theory. In so doing, it brings together a great deal of exciting recent work in the literature, and is sure to be a valuable companion for all those interested in these topics. (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.

I argue that the best spacetime setting for Newtonian gravitation (NG) is the curved spacetime setting associated with geometrized Newtonian gravitation (GNG). Appreciation of the ‘Newtonian equivalence principle’ leads us to conclude that the gravitational field in NG itself is a gauge quantity, and that the freely falling frames are naturally identified with inertial frames. In this context, the spacetime structure of NG is represented not by the flat neo-Newtonian connection usually made explicit in formulations, but by the sum (...) of the flat connection and the gravitational field. 1 Introduction2 Newtonian Gravity: The Orthodox Approach3 Newtonian Gravity: Additional Symmetries4 Cosmological Considerations5 A Newtonian Equivalence Principle: Inertial Frames in Newtonian Gravitation6 Theory Equivalence?7 Conclusion. (shrink)

A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its effective power over a cohesive set of natural numbers. A cohesive set is an infinite set of natural numbers that is indecomposable with respect to computably enumerable sets. It plays the role of an ultrafilter, and the elements of a cohesive power are the equivalence classes of certain partial computable functions determined by the (...) cohesive set. Thus, unlike many classical ultrapowers, a cohesive power is a countable structure. In this paper we focus on cohesive powers of graphs, equivalence structures, and computable structures with a single unary function satisfying various properties, which can also be viewed as directed graphs. For these computable structures, we investigate the isomorphism types of their cohesive powers, as well as the properties of cohesive powers when they are not isomorphic to the original structure. (shrink)

We generalize a well-known theorem binding the elementary equivalence relation on the level of PAC fields and the isomorphism type of their absolute Galois groups. Our results concern two cases: saturated PAC structures and nonsaturated PAC structures.

We study the degree structure of the ω-c.e., n-c.e., and Π10 equivalence relations under the computable many-one reducibility. In particular, we investigate for each of these classes of degrees the most basic questions about the structure of the partial order. We prove the existence of the greatest element for the ω-c.e. and n-computably enumerable equivalence relations. We provide computable enumerations of the degrees of ω-c.e., n-c.e., and Π10 equivalence relations. We prove that for all the degree classes (...) considered, upward density holds and downward density fails. (shrink)

We examine the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ of equivalence relations on $\omega $ under computable reducibility. We examine when pairs of degrees have a least upper bound. In particular, we show that sufficiently incomparable pairs of degrees do not have a least upper bound but that some incomparable degrees do, and we characterize the degrees which have a least upper bound with every finite equivalence relation. We show that the natural classes of finite, light, and dark (...) degrees are definable in $\operatorname {\mathrm {\mathbf {ER}}}$. We show that every equivalence relation has continuum many self-full strong minimal covers, and that $\mathbf {d}\oplus \mathbf {\operatorname {\mathrm {\mathbf {Id}}}_1}$ needn’t be a strong minimal cover of a self-full degree $\mathbf {d}$. Finally, we show that the theory of the degree structure $\operatorname {\mathrm {\mathbf {ER}}}$ as well as the theories of the substructures of light degrees and of dark degrees are each computably isomorphic with second-order arithmetic. (shrink)

We investigate effective categoricity of computable equivalence structures . We show that is computably categorical if and only if has only finitely many finite equivalence classes, or has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. Since all computable (...) class='Hi'>equivalence structures are relatively categorical, we further investigate when they are categorical. We also obtain results on the index sets of computable equivalence structures. (shrink)

We present some equivalent conditions for a quasivariety \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {K}}$$\end{document} of structures to be generated by a single structure. The first such condition, called the embedding property was found by A.I. Mal′tsev in [6]. It says that if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\bf A}, {\bf B} \in \mathcal {K}}$$\end{document} are nontrivial, then there exists \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\bf C} \in (...) \mathcal{K}}$$\end{document} such that A and B are embeddable into C. One of our equivalent conditions states that the set of quasi-identities valid in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{K}}$$\end{document} is closed under a certain Gentzen type rule which is due to J. Łoś and R. Suszko [5]. (shrink)

We solve a problem posed by Goncharov and Knight 639–681, 757]). More specifically, we produce an effective Friedberg enumeration of computable equivalence structures, up to isomorphism. We also prove that there exists an effective Friedberg enumeration of all isomorphism types of infinite computable equivalence structures.

The author endeavours to show two things: first, that Schrödingers (and Eckarts) demonstration in March (September) 1926 of the equivalence of matrix mechanics, as created by Heisenberg, Born, Jordan and Dirac in 1925, and wave mechanics, as created by Schrödinger in 1926, is not foolproof; and second, that it could not have been foolproof, because at the time matrix mechanics and wave mechanics were neither mathematically nor empirically equivalent. That they were is the Equivalence Myth. In order to (...) make the theories equivalent and to prove this, one has to leave the historical scene of 1926 and wait until 1932, when von Neumann finished his magisterial edifice. During the period 1926–1932 the original families of mathematical structures of matrix mechanics and of wave mechanics were stretched, parts were chopped off and novel structures were added. To Procrustean places we go, where we can demonstrate the mathematical, empirical and ontological equivalence of ‘the final versions of’ matrix mechanics and wave mechanics. -/- The present paper claims to be a comprehensive analysis of one of the pivotal papers in the history of quantum mechanics: Schrödingers equivalence paper. Since the analysis is performed from the perspective of Suppes structural view (‘semantic view’) of physical theories, the present paper can be regarded not only as a morsel of the internal history of quantum mechanics, but also as a morsel of applied philosophy of science. The paper is self-contained and presupposes only basic knowledge of quantum mechanics. For reasons of length, the paper is published in two parts; Part I appeared in the previous issue of this journal. Section 1 contains, besides an introduction, also the papers five claims and a preview of the arguments supporting these claims; so Part I, Section 1 may serve as a summary of the paper for those readers who are not interested in the detailed arguments. (shrink)

The author endeavours to show two things: first, that Schrödingers (and Eckarts) demonstration in March (September) 1926 of the equivalence of matrix mechanics, as created by Heisenberg, Born, Jordan and Dirac in 1925, and wave mechanics, as created by Schrödinger in 1926, is not foolproof; and second, that it could not have been foolproof, because at the time matrix mechanics and wave mechanics were neither mathematically nor empirically equivalent. That they were is the Equivalence Myth. In order to (...) make the theories equivalent and to prove this, one has to leave the historical scene of 1926 and wait until 1932, when von Neumann finished his magisterial edifice. During the period 1926–1932 the original families of mathematical structures of matrix mechanics and of wave mechanics were stretched, parts were chopped off and novel structures were added. To Procrustean places we go, where we can demonstrate the mathematical, empirical and ontological equivalence of ‘the final versions of’ matrix mechanics and wave mechanics. -/- The present paper claims to be a comprehensive analysis of one of the pivotal papers in the history of quantum mechanics: Schrödingers equivalence paper. Since the analysis is performed from the perspective of Suppes structural view (‘semantic view’) of physical theories, the present paper can be regarded not only as a morsel of the internal history of quantum mechanics, but also as a morsel of applied philosophy of science. The paper is self-contained and presupposes only basic knowledge of quantum mechanics. For reasons of length, the paper is published in two parts; Part I appeared in the previous issue of this journal. Section 1 contains, besides an introduction, also the papers five claims and a preview of the arguments supporting these claims; so Part I, Section 1 may serve as a summary of the paper for those readers who are not interested in the detailed arguments. (shrink)

It has been suggested that we can tell whether two theories are equivalent by comparing the structure that they ascribe to the world. If two theories posit different structures, then they must be i...

The thesis of the empirical underdetermination of theories (U-thesis) maintains that there are incompatible theories which are empirically equivalent. Whether this is an interesting thesis depends on how the term incompatible is understood. In this paper a structural explication is proposed. More precisely, the U-thesis is studied in the framework of the model theoretic or emantic approach according to which theories are not to be taken as linguistic entities, but rather as families of mathematical structures. Theories of similarity (...) class='Hi'>structures are studied as a paradigmatic case. The structural approach further reveals that the U-thesis is related to problems of uniqueness in the representational theory of measurement, questions of geometric conventionalism, and problems of structural underdetermination in mathematics. (shrink)

Group-structured populations, of the kind prominent in discussions of multilevel selection, are contrasted with ‘neighbor-structured’ populations. I argue that it is a necessary condition on multilevel description of a selection process that there should be a nonarbitrary division of the population into equivalence classes (or an approximation to this situation). The discussion is focused via comparisons between two famous problem cases involving group structure (altruism and heterozygote advantage) and two neighbor-structured cases that resemble them. Conclusions are also drawn about (...) the role of correlated interaction in the evolution of altruism. 1 Introduction 2 Two Kinds of Population Structure 3 Objections and Replies 4 Particles on a Line 5 Conclusion Appendix: Neighborhoods and Selection CiteULike Connotea Del.icio.us What's this? (shrink)

Let K be a family of structures, closed under isomorphism, in a fixed computable language. We consider effective lists of structures from K such that every structure in K is isomorphic to exactly one structure on the list. Such a list is called a computable classification of K, up to isomorphism. Using the technique of Friedberg enumeration, we show that there is a computable classification of the family of computable algebraic fields and that with a 0'-oracle, we can (...) obtain similar classifications of the families of computable equivalence structures and of computable finite-branching trees. However, there is no computable classification of the latter, nor of the family of computable torsion-free abelian groups of rank 1, even though these families are both closely allied with computable algebraic fields. (shrink)

We give a level-by-level analysis of the Weak Vopěnka Principle for definable classes of relational structures ( $\mathrm {WVP}$ ), in accordance with the complexity of their definition, and we determine the large-cardinal strength of each level. Thus, in particular, we show that $\mathrm {WVP}$ for $\Sigma _2$ -definable classes is equivalent to the existence of a strong cardinal. The main theorem (Theorem 5.11) shows, more generally, that $\mathrm {WVP}$ for $\Sigma _n$ -definable classes is equivalent to the existence (...) of a $\Sigma _n$ -strong cardinal (Definition 5.1). Hence, $\mathrm {WVP}$ is equivalent to the existence of a $\Sigma _n$ -strong cardinal for all $n<\omega $. (shrink)

Learning equivalence classes of acyclic models with latent and selection variables from multiple datasets with overlapping variables is discussed. The problem of inferring the presence of latent variables, their relation to the observables, and the relation among themselves, is considered. A different approach for identifying causal structures, one that results in much simpler equivalence classes, is provided. It is found that the computational cost is much higher than the procedure implemented, but if datasets are individually of modest (...) dimensionality, it might be doable in practice. From the point of view of search algorithms for optimizing structure, much of the machinery of combinatorial optimization could optimize the penalized composite likelihood score by enforcing constraints such that the independence models over different subsets of variables agree on the overlapping sets. (shrink)

For a computable structure \, if there is a computable infinitary Scott sentence, then the complexity of this sentence gives an upper bound for the complexity of the index set \\). If we can also show that \\) is m-complete at that level, then there is a correspondence between the complexity of the index set and the complexity of a Scott sentence for the structure. There are results that suggest that these complexities will always match. However, it was shown in (...) Knight and McCoy that there is a structure ) for which the index set is m-complete \, though there is no computable \ Scott sentence. In the present paper, we give an example of a particular equivalence structure for which the index set is m-complete \ but for which there is no computable \ Scott sentence. There is, however, a computable \ pseudo-Scott sentence for the structure, that is, a sentence that acts as a Scott sentence if we only consider computable structures. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. Motivated by results of Bagaria, Magidor and Väänänen, we study characterizations of large cardinal properties through reflection principles for classes of structures. More specifically, we aim to characterize notions from the lower end of the large cardinal hierarchy through the principle [math] introduced by Bagaria and Väänänen. Our results isolate a narrow interval in the large cardinal hierarchy that is bounded from below by total indescribability and from above by (...) subtleness, and contains all large cardinals that can be characterized through the validity of the principle [math] for all classes of structures defined by formulas in a fixed level of the Lévy hierarchy. Moreover, it turns out that no property that can be characterized through this principle can provably imply strong inaccessibility. The proofs of these results rely heavily on the notion of shrewd cardinals, introduced by Rathjen in a proof-theoretic context, and embedding characterizations of these cardinals that resembles Magidor’s classical characterization of supercompactness. In addition, we show that several important weak large cardinal properties, like weak inaccessibility, weak Mahloness or weak [math]-indescribability, can be canonically characterized through localized versions of the principle [math]. Finally, the techniques developed in the proofs of these characterizations also allow us to show that Hamkin’s weakly compact embedding property is equivalent to Lévy’s notion of weak [math]-indescribability. (shrink)

We examine the effective categoricity of equivalence structures via Ershov's difference hierarchy. We explore various kinds of categoricity available by distinguishing three different notions of isomorphism available in this hierarchy. We prove several results relating our notions of categoricity to computable equivalence relations: for example, we show that, for such relations, computable categoricity is equivalent to our notion of weak ω-c.e. categoricity, and that $\Delta _2^0 $ -categoricity is equivalent to our notion of graph-ω-c.e. categoricity.

We are used to talking about the “structure” posited by a given theory of physics, such as the spacetime structure of relativity. What is “structure”? What does the mathematical structure used to formulate a theory tell us about the physical world according to the theory? What if there are different mathematical formulations of a given theory? Do different formulations posit different structures, or are they merely notational variants? I consider the case of Lagrangian and Hamiltonian classical mechanics. I argue (...) that, contrary to standard wisdom, these are not genuinely equivalent theories: they differ in statespace structure. I suggest that we should be realists about statespace structure. (shrink)

We discuss puzzles of prisoners and hats with infinitely many prisoners and more than two hat colors. Assuming that the set of hat colors is equipped with a commutative group structure, we prove strategic equivalence among puzzles of several protocols with countably many prisoners.

Sensations can occur in the absence of perception and yet be experienced ‘as if’ seen, heard, tasted, or otherwise perceived. Two concepts used to investigate types of these sensory-like mental phenomena (SLMP) are mental imagery and hallucinations. Mental imagery is used as a concept for investigating those SLMP that merely resemble perception in some way. Meanwhile, the concept of hallucinations is used to investigate those SLMP that are, in some sense, compellingly like perception. This may be a difference of degree. (...) Attempts to reliably differentiate between instances of each type of SLMP remain unresolved. Despite this, the concepts of mental imagery and hallucinations are each routinely used independently of the other. These uses are especially interesting in those published accounts of experiments where equivalent findings about the neuroanatomical correlates of SLMP are reported in support of diverging knowledge-claims about the role of SLMP in neurocognitive processes. This practice presents a puzzle. To examine one aspect of this puzzle, I compare the uses of these two scientific concepts in three ways: examining their roles in differentiating between types of SLMP; exploring how their respective historical developments intersect; and analysing their contributions in neuroimaging experiments. In presenting this series of comparative analyses, I will draw on three themes from historical, philosophical, and social studies of scientific practices: interest in material contributions to knowledge; accounts of how concepts are used in experiments; and explorations of the historical conditions within which current practices emerge. Building on this literature, my comparative analyses supports five related claims. My first claim is that the concepts of mental imagery and hallucinations are each used as independent tools in neuroimaging experiments. My second claim is that, as experimental tools, the concepts of mental imagery and hallucinations are each used for investigating discrete epistemic goals. My third claim is that there are implicit interdependent associations that structure the uses of these two concepts as tools for independently investigating these discrete epistemic goals in neuroimaging experiments. This third claim rests on my analyses of both past and present uses of each concept. Firstly, as seen in their intersecting histories, there are disciplined performances of using the concepts of mental imagery and hallucinations that carry-along shared associations about the mediating role of SLMP in thought. Secondly, these interdependent ‘mediator-view’ associations continue to structure the independent uses of each concept as a tool for investigating SLMP in pursuit of specific goals. Taking this further, my fourth claim is that recognising the structured uses of the concepts of mental imagery and hallucinations can help to account for how equivalent SLMP-neuro-correlates are generated in support of diverging knowledge-claims. Finally, my fifth claim is that the structured uses of these concepts as tools can contribute to experiments in ways analogous to, yet not equivalent with, the active contributions of material instruments. Bringing these claims together, I argue that the concepts of mental imagery and hallucinations operate as structured tools that can actively contribute to the knowledge generated by neuroimaging experiments. In presenting this argument I seek to demonstrate that examining the structured uses of concepts as tools can complement existing approaches to studying how the heterogeneous dynamics of experimental practices can come to contribute to scientific knowledge in unintended ways. (shrink)