If T is an unstable theory of cardinality <λ or countable stable theory with OTOP or countable superstable theory with DOP, λω λω1 in the superstable with DOP case) is regular and λ<λ=λ, then we construct for T strongly equivalent nonisomorphic models of cardinality λ. This can be viewed as a strong nonstructure theorem for such theories. We also consider the case when T is unsuperstable and develop further a result of Shelah about the existence of L∞,λ-equivalent nonisomorphic models (...) for such T. In addition, we show that a natural analogue of Scott's isomorphism theorem fails for models of power κ, if κω is regular, assuming κ<κ=κ. (shrink)

We study how equivalent nonisomorphic models an unsuperstable theory can have. We measure the equivalence by Ehrenfeucht-Fraisse games. This paper continues the work started in $[HT]$.

We study how equivalent nonisomorphic models of unsuperstable theories can be. We measure the equivalence by Ehrenfeucht-Fraisse games. This paper continues [HS].

In this paper we prove a strong nonstructure theorem for $\kappa$-saturated models of a stable theory T with dop. This paper continues the work started in [1].

In this paper we prove a strong nonstructure theorem for κ(T)-saturated models of a stable theory T with dop. This paper continues the work started in [1].

In this paper we prove a strong nonstructure theorem for κ(T)-saturated models of a stable theory T with dop. This paper continues the work started in [1].

The various physical aspects of the general relativistic principles of covariance and strong equivalence are discussed, and their mathematical formulations are analyzed. All these aspects are shown to be present in classical general relativity, although no contemporary formulation of canonical or covariant quantum gravity has succeeded to incorporate them all. This has, in part, motivated the recent introduction of a geometro-stochastic framework for quantum general relativity, in which the classical frame bundles that underlie the formulation of parallel transport (...) in classical general relativity are replaced by quantum frame bundles. It is shown that quantum frames can take over the role played by complete sets of observables in conventional quantum theory, so that they can mediate the natural transference of the general covariance and the strong equivalence principles from the classical to the quantum general relativistic regime. This results in a geometrostochastic mode of quantum propagation in general relativistic quantum bundles, which is mathematically implemented by path integration methods based on parallel transport along horizontal lifts of geodesics for the vacuum expectation values of a quantum gravitational field in a quantum spacetime supermanifold. The covariance features of this field are embedded in a quantum gravitational supergroup, which incorporates Poincaré as well as diffeomorphism invariance, and resolves the issue of time in quantum gravity. (shrink)

The "space" of Lascar strong types, on some sort and relative to a given complete theory T, is in general not a compact Hausdorff topological space. We have at least three aims in this paper. The first is to show that spaces of Lascar strong types, as well as other related spaces and objects such as the Lascar group Gal L of T, have well-defined Borel cardinalities. The second is to compute the Borel cardinalities of the known examples (...) as well as of some new examples that we give. The third is to explore notions of definable map, embedding, and isomorphism, between these and related quotient objects. We also make some conjectures, the main one being roughly "smooth if and only if trivial". The possibility of a descriptive set-theoretic account of the complexity of spaces of Lascar strong types was touched on in the paper [E. Casanovas, D. Lascar, A. Pillay and M. Ziegler, Galois groups of first order theories, J. Math. Logic1 305–319], where the first example of a "non-G-compact theory" was given. The motivation for writing this paper is partly the discovery of new examples via definable groups, in [A. Conversano and A. Pillay, Connected components of definable groups and o-minimality I, Adv. Math.231 605–623; Connected components of definable groups and o-minimality II, to appear in Ann. Pure Appl. Logic] and the generalizations in [J. Gismatullin and K. Krupiński, On model-theoretic connected components in some group extensions, preprint, arXiv:1201.5221v1]. (shrink)

Shows that a certain temporal logic has infinitely many non-equivalent formulae in a single variable.

In “A new proof of the completeness of the Lukasiewicz axioms” Chang proved that any totally ordered MV-algebra A was isomorphic to the segment \}\) of a totally ordered l-group with strong unit A *. This was done by the simple intuitive idea of putting denumerable copies of A on top of each other. Moreover, he also show that any such group G can be recovered from its segment since \^*}\), establishing an equivalence of categories. In “Interpretation of (...) AF C *-algebras in Lukasiewicz sentential calculus” Mundici extended this result to arbitrary MV-algebras and l-groups with strong unit. He takes the representation of A as a sub-direct product of chains A i, and observes that \ where \. Then he let A * be the l-subgroup generated by A inside \. He proves that this idea works, and establish an equivalence of categories in a rather elaborate way by means of his concept of good sequences and its complicated arithmetics. In this note, essentially self-contained except for Chang’s result, we give a simple proof of this equivalence taking advantage directly of the arithmetics of the the product l-group \, avoiding entirely the notion of good sequence. (shrink)

We force and construct models in which there are non-supercompact strongly compact cardinals which aren't measurable limits of strongly compact cardinals and in which level by level equivalence between strong compactness and supercompactness holds non-trivially except at strongly compact cardinals. In these models, every measurable cardinal κ which isn't either strongly compact or a witness to a certain phenomenon first discovered by Menas is such that for every regular cardinal λ > κ, κ is λ strongly compact iff (...) κ is λ supercompact. (shrink)

In this paper we extend Mundici’s functor Γ to the category of monadic MV-algebras. More precisely, we define monadic ℓ-groups and we establish a natural equivalence between the category of monadic MV-algebras and the category of monadic ℓ-groups with strong unit. Some applications are given thereof.

We force and obtain three models in which level by level equivalence between strong compactness and supercompactness holds and in which, below the least supercompact cardinal, GCH fails unboundedly often. In two of these models, GCH fails on a set having measure 1 with respect to certain canonical measures. There are no restrictions in all of our models on the structure of the class of supercompact cardinals.

In this paper we extend Mundici’s functor Γ to the category of monadic MV-algebras. More precisely, we define monadic ℓ -groups and we establish a natural equivalence between the category of monadic MV-algebras and the category of monadic ℓ -groups with strong unit. Some applications are given thereof.

We construct models for the level by level equivalence between strong compactness and supercompactness in which for κ the least supercompact cardinal and δ ≤ κ any cardinal which is either a strong cardinal or a measurable limit of strong cardinals, 2δ > δ+ and δ is < 2δ supercompact. In these models, the structure of the class of supercompact cardinals can be arbitrary, and the size of the power set of κ can essentially be made (...) as large as desired. This extends and generalizes [5, Theorem 2] and [4, Theorem 4]. We also sketch how our techniques can be used to establish a weak indestructibility result. (shrink)

This paper shows that weak Pareto and strong Pareto are equivalent under continuity and strong quasi-concavity. We use a framework that incorporates welfare as well as non-welfare information.

It is known that if $\kappa < \lambda$ are such that κ is indestructibly supercompact and λ is 2λ supercompact, then level by level equivalence between strong compactness and supercompactness fails. We prove a theorem which points towards this result being best possible. Specifically, we show that relative to the existence of a supercompact cardinal, there is a model for level by level equivalence between strong compactness and supercompactness containing a supercompact cardinal κ in which κ’s (...) strong compactness is indestructible under κ-directed closed forcing. (shrink)

Aim of this paper is to provide a self-contained presentation of the natural equivalence between MV-algebras and lattice-ordered abelian groups with strong unit.

I discuss the relationship between different versions of the equivalence principle in general relativity, among them Einstein's equivalence principle, the weak equivalence principle, and the strong equivalence principle. I show that Einstein's version of the equivalence principle is intimately linked to his idea that in GR gravity and inertia are unified to a single field, quite like the electric and magnetic field had been unified in special relativistic electrodynamics. At the same time, what is (...) now often called the strong equivalence principle, related to the local validity of special relativity, can also be found in Einstein's writings, albeit by a different name and clearly separated from what he calls the equivalence principle. I discuss both the development of Einstein's thoughts on the different versions of the equivalence principle, their relationship to the relativity principle, as well as later reflections and variants proposed. (shrink)

A precise fomulation of the strong Equivalence Principle is essential to the understanding of the relationship between gravitation and quantum mechanics. The relevant aspects are reviewed in a context including General Relativity but allowing for the presence of torsion. For the sake of brevity, a concise statement is proposed for the Principle: An ideal observer immersed in a gravitational field can choose a reference frame in which gravitation goes unnoticed. This statement is given a clear mathematical meaning through (...) an accurate discussion of its terms. It holds for ideal observers (time-like smooth non-intersecting curves), but not for real, spatially extended observers. Analogous results hold for gauge fields. The difference between gravitation and the other fundamental interactions comes from their distinct roles in the equation of force. (shrink)

We consider the logics determined by the set of all natural implicative expansions of Kleene’s strong 3-valued matrix and select the class of all logics functionally equivalent to Łukasiewicz’s 3-valued logic Ł3. The concept of a “natural implicative matrix” is based upon the notion of a “natural conditional” defined in Tomova.

In this paper we extend Mundici's functor? to the category of monadic MV- algebras. More precisely, we define monadic?- groups and we establish a natural equivalence between the category of monadic MV- algebras and the category of monadic?- groups with strong unit. Some applications are given thereof.

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of L ω ₁ ω ) is far from complete (see (...) [5, 2]). In this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of ω ₁ ω , but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoids. (shrink)

The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language class showing that a tree language is a member of this class iff it is the two-dimensional yield of (...) an MSO-definable three-dimensional tree language. (shrink)

Recently some results have been presented which show that certain kinds of deterministic descriptions and indeterministic descriptions are observationally equivalent (Werndl 2009a, 2010). This paper focuses on some philosophical questions prompted by these results. More specifically, first, I will discuss the philosophical comments made by mathematicians about observational equivalence, in particular Ornstein and Weiss (1991). Their comments are vague, and I will argue that, according to a reasonable interpretation, they are misguided. Second, the results on observational equivalence raise (...) the question of whether the deterministic or indeterministic description is preferable relative to all evidence. If none of them is preferable, there is underdetermination. I will criticize Winnie's (1998) argument that, by appealing to different observations, one finds that the deterministic description is preferable. In particular, I will clarify a confusion in this argument. Furthermore, I will argue that if the concern is a strong kind of underdetermination, the argument delivers the desired conclusion but this conclusion is trivial; and for other kinds of underdetermination of interest the argument fails. (shrink)

A strongly deterministic theory of physics is one that permits exactly one possible history of the universe. In the words of Penrose (1989), "it is not just a matter of the future being determined by the past; the entire history of the universe is fixed, according to some precise mathematical scheme, for all time.” Such an extraordinary feature may appear unattainable in a world like ours. In this paper, I show that it can be achieved in a simple way and (...) discuss its implications for metaphysics and philosophy of science, including natural properties, free will, explanation, and modality. First, I propose a precise definition of strong determinism. Next, I discuss its philosophical ramifications and a toy example. Finally, I provide a realistic example of a strongly deterministic (and simple) physical theory---the Everettian Wentaculus. A surprising consequence is that whether or not our world is strongly deterministic may be empirically underdetermined. (shrink)

The paper studies the relation between systems of modal logic and systems of consequential implication, a non-material form of implication satisfying "Aristotle's Thesis" (p does not imply not p) and "Weak Boethius' Thesis" (if p implies q, then p does not imply not q). Definitions are given of consequential implication in terms of modal operators and of modal operators in terms of consequential implication. The modal equivalent of "Strong Boethius' Thesis" (that p implies q implies that p does not (...) imply not q) is identified. (shrink)

Normative systems have been advocated as an effective tool to regulate interaction in multi-agent systems. The use of deontic operators and the ability to represent defeasible information are known to be two fundamental ingredients to represent and reason about normative systems. In this paper, after introducing a framework that combines standard deontic logic and non-monotonic logic programming, deontic logic programs (DLP), we tackle the fundamental problem of equivalence between normative systems using a deontic extension of David Pearce’s Equilibrium Logic (...) and its monotonic basis, the logic of Here-and-There. We also show how deontic logic programs can be used to represent and reason about normative systems, and establish a strong connection with input-output logic. (shrink)

The notion of a strongly determined type over A extending p is introduced, where p .S. A strongly determined extension of p over A assigns, for any model M )- A, a type q S extending p such that, if realises q, then any elementary partial map M → M which fixes acleq pointwise is elementary over . This gives a crude notion of independence which arises very frequently. Examples are provided of many different kinds of theories with strongly determined (...) types, and some without. We investigate a notion of multiplicity for strongly determined types with applications to ‘involved’ finite simple groups, and an analogue of the Finite Equivalence Relation Theorem. Lifting of strongly determined types to covers of a structure is discussed, and an application to finite covers is given. (shrink)

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs is far from complete.In this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence (...) relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of ℒω1ω, but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoids. (shrink)

A quantum particle moving in a gravitational field may penetrate the classically forbidden region of the gravitational potential. This raises the question of whether the time of flight of a quantum particle in a gravitational field might deviate systematically from that of a classical particle due to tunnelling delay, representing a violation of the weak equivalence principle. I investigate this using a model quantum clock to measure the time of flight of a quantum particle in a uniform gravitational field, (...) and show that a violation of the equivalence principle does not occur when the measurement is made far from the turning point of the classical trajectory. The results are then confirmed using the so-called dwell time definition of quantum tunnelling. I conclude with some remarks about the strong equivalence principle in quantum mechanics. (shrink)

Necessitism, Contingentism, and Theory Equivalence is a dissertation on issues in higher-order modal metaphysics. Consider a modal higher-order language with identity in which the universal quantifier is interpreted as expressing universal quantification and the necessity operator is interpreted as expressing metaphysical necessity. The main question addressed in the dissertation concerns the correct theory formulated in this language. A different question that also takes centre stage in the dissertation is what it takes for theories to be equivalent.The whole dissertation consists (...) of an extended argument in defence of the truth of two seemingly inconsistent higher-order modal theories, specifically: 1.Plantingan Moderate Contingentism, a theory based on Plantinga’s [1] modal metaphysics that is committed to, among other things, the contingent being of some individuals and the necessary being of all possible higher-order entities;2.Williamsonian Thorough Necessitism, a theory advocated by Williamson [3] which is committed to, among other things, the necessary being of every possible individual as well as of every possible higher-order entity.Part of the case for these theories’ joint truth relies on defences of the following metaphysical theses: Thorough Serious Actualism, the thesis that no things could have been related while being nothing, and Higher-Order Necessitism, the thesis that necessarily, every higher-order entity is necessarily something. It is shown that Thorough Serious Actualism and Higher-Order Necessitism are both implicit commitments of very weak logical theories. The defence of Higher-Order Necessitism constitutes a powerful challenge to Stalnaker’s [2] Thorough Contingentism, a theory committed to, among other things, the view that there could have been some individuals as well as some entities of any higher-order that could have been nothing.In the dissertation it is argued that Plantingan Moderate Contingentism and Williamsonian Thorough Necessitism are in fact equivalent, even if they appear to be jointly inconsistent. The case for this claim relies on the Synonymy account, a novel account of theory equivalence developed and defended in the dissertation. According to this account, theories are equivalent just in case they have the same commitments and conception of logical space.By way of defending the Synonymy account’s adequacy, the account is applied to the debate between noneists, proponents of the view that some things do not exist, and Quineans, proponents of the view that to exist just is to be some thing. The Synonymy account is shown to afford a more nuanced and better understanding of that debate by revealing that what noneists and Quineans are really disagreeing about is what expressive resources are available to appropriately describe the world.By coupling a metatheoretical result with tools from the philosophy of language, it is argued that Plantingan Moderate Contingentism and Williamsonian Thorough Necessitism are synonymous theories, and so, by the lights of the Synonymy account, equivalent. Given the defence of their extant commitments made in the dissertation, it is concluded that Plantingan Moderate Contingentism and Williamsonian Thorough Necessitism are both correct. A corollary of this result is that the dispute between Plantingans and Williamsonians is, in an important sense, merely verbal. For if two theories are equivalent, then they “require the same of the world for their truth.”Thus, the results of the dissertation reveal that if one speaks as a Plantingan while advocating Plantingan Moderate Contingentism, or as a Williamsonian while advocating Williamsonian Thorough Necessitism, then one will not go wrong. Notwithstanding, one will still go wrong if one speaks as a Plantingan while advocating Williamsonian Thorough Necessitism, or as a Williamsonian while advocating Plantingan Moderate Contingentism.On the basis of a conception of the individual constants and predicates of second-order modal languages as strongly Millian, i.e., as having actually existing entities as their semantic values, in the appendix are presented second-order modal logics consistent with Stalnaker’s Thorough Contingentism. Furthermore, it is shown there that these logics are strong enough for applications of higher-order modal logic in mathematics, a result that constitutes a reply to an argument to the contrary by Williamson [3]. Finally, these logics are proven to be complete relative to particular “thoroughly contingentist” classes of models. (shrink)

The strong continuity principle reads “every pointwise continuous function from a complete separable metric space to a metric space is uniformly continuous near each compact image.” We show that this principle is equivalent to the fan theorem for monotone \ bars. We work in the context of constructive reverse mathematics.

In this paper we show that there is no minimal bound for jump traceability. In particular, there is no single order function such that strong jump traceability is equivalent to jump traceability for that order. The uniformity of the proof method allows us to adapt the technique to showing that the index set of the c.e. strongly jump traceables is image-complete.

A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually defined with respect to the uniform measure on the set of all sequences, but extend canonically to other computable probability measures. This way each notion of randomness induces an equivalence relation on the computable probability measures where two measures are equivalent if they have the same set of random sequences. In what (...) follows, we study the equivalence relations induced by Martin-Löf randomness, computable randomness, Schnorr randomness and Kurtz randomness, together with the relations of equivalence and consistency from probability theory. We show that all these relations coincide when restricted to the class of computable strongly positive generalized Bernoulli measures. For the case of arbitrary computable measures, we obtain a complete and somewhat surprising picture of the implications between these relations that hold in general. (shrink)

A strongly independent preorder on a possibly in finite dimensional convex set that satisfi es two of the following conditions must satisfy the third: (i) the Archimedean continuity condition; (ii) mixture continuity; and (iii) comparability under the preorder is an equivalence relation. In addition, if the preorder is nontrivial (has nonempty asymmetric part) and satisfi es two of the following conditions, it must satisfy the third: (i') a modest strengthening of the Archimedean condition; (ii') mixture continuity; and (iii') completeness. (...) Applications to decision making under conditions of risk and uncertainty are provided. (shrink)

If κ < λ are such that κ is indestructibly supercompact and λ is 2λ supercompact, it is known from [4] that {δ < κ | δ is a measurable cardinal which is not a limit of measurable cardinals and δ violates level by level equivalence between strong compactness and supercompactness}must be unbounded in κ. On the other hand, using a variant of the argument used to establish this fact, it is possible to prove that if κ < (...) λ are such that κ is indestructibly supercompact and λ is measurable, then {δ < κ | δ is a measurable cardinal which is not a limit of measurable cardinals and δ satisfies level by level equivalence between strong compactness and supercompactness}must be unbounded in κ. The two aforementioned phenomena, however, need not occur in a universe with an indestructibly supercompact cardinal and sufficiently few large cardinals. In particular, we show how to construct a model with an indestructibly supercompact cardinal κ in which if δ < κ is a measurable cardinal which is not a limit of measurable cardinals, then δ must satisfy level by level equivalence between strong compactness and supercompactness. We also, however, show how to construct a model with an indestructibly supercompact cardinal κ in which if δ < κ is a measurable cardinal which is not a limit of measurable cardinals, then δ must violate level by level equivalence between strong compactness and supercompactness. (shrink)

This Perspective traces the evolution of certain central notions in the theory of Generative Grammar (GG). The founding documents of the field suggested a relation between the grammar, construed as recursively enumerating an infinite set of sentences, and the idealized native speaker that was essentially equivalent to the relation between a formal language (a set of well-formed formulas) and an automaton that recognizes strings as belonging to the language or not. But this early view was later abandoned, when the focus (...) of the field shifted to the grammar's strong generative capacity as recursive generation of hierarchically structured objects as opposed to strings. The grammar is now no longer seen as specifying a set of well-formed expressions and in fact necessarily constructs expressions of any degree of intuitive “acceptability.” The field of GG, however, has not sufficiently acknowledged the significance of this shift in perspective, as evidenced by the fact that (informal and experimentally-controlled) observations about string acceptability continue to be treated as bona fide data and generalizations for the theory of GG. The focus on strong generative capacity, it is argued, requires a new discussion of what constitutes valid empirical evidence for GG beyond observations pertaining to weak generation. (shrink)

Our evidence can be about different subject matters. In fact, necessarily equivalent pieces of evidence can be about different subject matters. Does the hyperintensionality of ‘aboutness’ engender any hyperintensionality at the level of rational credence? In this paper, I present a case which seems to suggest that the answer is ‘yes’. In particular, I argue that our intuitive notions of independent evidence and inadmissible evidence are sensitive to aboutness in a hyperintensional way. We are thus left with a paradox. While (...) there is strong reason to think that rational credence cannot make such hyperintensional distinctions, our intuitive judgements about certain cases seem to demand that it does. (shrink)

We introduce the strongly uplifting cardinals, which are equivalently characterized, we prove, as the superstrongly unfoldable cardinals and also as the almost-hugely unfoldable cardinals, and we show that their existence is equiconsistent over ZFC with natural instances of the boldface resurrection axiom, such as the boldface resurrection axiom for proper forcing.

A category theoretic generalization of the theory of algebraizable deductive systems of Blok and Pigozzi is developed. The theory of institutions of Goguen and Burstall is used to provide the underlying framework which replaces and generalizes the universal algebraic framework based on the notion of a deductive system. The notion of a term π-institution is introduced first. Then the notions of quasi-equivalence, strong quasi-equivalence and deductive equivalence are defined for π-institutions. Necessary and sufficient conditions are given (...) for the quasi-equivalence and the deductive equivalence of two term π-institutions, based on the relationship between their categories of theories. The results carry over without any complications to institutions, via their associated π-institutions. The π-institution associated with a deductive system and the institution of equational logic are examined in some detail and serve to illustrate the general theory. (shrink)