We show that there are models and such that elementarily embeds into but their ultrafilter extensions and are not elementarily equivalent.

Two logics L1 and L2 are negatively equivalent if for any set of formulas X and any negated formula ¬, ¬ can be deduced from the set of hypotheses X in L1 if and only if it can be done in L2. This article is devoted to the investigation of negative equivalence relation in the class of extensions of minimal logic.

For Tarski logics, there are simple criteria that enable one to conclude that two premise sets are equivalent. We shall show that the very same criteria hold for adaptive logics, which is a major advantage in comparison to other approaches to defeasible reasoning forms. A related property of Tarski logics is that the extensions of equivalent premise sets with the same set of formulas are equivalent premise sets. This does not hold for adaptive logics. However a very similar criterion does. (...) We also shall show that every monotonic logic weaker than an adaptive logic is weaker than the lower limit logic of the adaptive logic or identical to it. This highlights the role of the lower limit for settling the adaptive equivalence of extensions of equivalent premise sets. (shrink)

This chapter contains sections titled: Cognitive Equivalence The Complementarity Argument Evolutionary Arguments Conclusion: The Importance of the Mark of the Cognitive.

As a prolegomenon to understanding the sense in which dualities are theoretical equivalences, we investigate the intuitive `equivalence' of hyper-regular Lagrangian and Hamiltonian classical mechanics. We show that the symplectification of these theories provides a sense in which they are isomorphic, and mutually and canonically definable through an analog of `common definitional extension'.

In this paper, we are concerned with the preorderings (SS) and (BC) induced in the set of players of a simple game by the Shapley–Shubik and the Banzhaf–Coleman's indices, respectively. Our main result is a generalization of Tomiyama's 1987 result on ordinal power equivalence in simple games; more precisely, we obtain a characterization of the simple games for which the (SS) and the (BC) preorderings coincide with the desirability preordering (T), a concept introduced by Isbell (1958), and recently reconsidered (...) by Taylor (1995): this happens if and only if the game is swap robust, a concept introduced by Taylor and Zwicker (1993). Since any weighted majority game is swap robust, our result is therefore a generalization of Tomiyama's. Other results obtained in this paper say that the desirability relation keeps itself in all the veto-holder extensions of any simple game, and so does the (SS) preordering in all the veto-holder extensions of any swap robust simple game. (shrink)

Several extensions of Gödel's system TT with new forms of recursion have been designed for the purpose of giving a computational interpretation to classical analysis. One can organise many of these extensions into two groups: those based on bar recursion , which include Spector's original bar recursion, modified bar recursion and the more recent products of selections functions, or those based on open recursion which in particular include the symmetric Berardi–Bezem–Coquand functional. We relate these two groups by showing that both (...) open recursion and the BBC functional are primitive recursively equivalent to a variant of modified bar recursion. Our results, in combination with existing research, essentially complete the classification up to primitive recursive equivalence of those extensions of system TT used to give a direct computational interpretation to choice principles. (shrink)

Let E be a Σ1 1 equivalence relation for which there does not exist a perfect set of inequivalent reals. If 0# exists or if V is a forcing extension of L, then there is a good ▵1 2 well-ordering of the equivalence classes.

The purpose of this paper is to examine in detail a particularly interesting pair of first-order theories. In addition to clarifying the overall geography of notions of equivalence between theories, this simple example yields two surprising conclusions about the relationships that theories might bear to one another. In brief, we see that theories lack both the Cantor-Bernstein and co-Cantor-Bernstein properties.

Łukasiewicz three-valued logic Ł3 is often understood as the set of all 3-valued valid formulas according to Łukasiewicz’s 3-valued matrices. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: “well-determined” Ł3a and “truth-preserving” Ł3b defined by two different consequence relations on the 3-valued matrices. The aim of this paper is to provide (by using Dunn semantics) dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic Ł3 is axiomatized as an extension of (...) Routley and Meyer’s basic positive logic following Brady’s strategy for axiomatizing many-valued logics by employing two-valued under-determined or over-determined interpretations. Finally, it is proved that “well determined” Łukasiewicz logics are paraconsistent. (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)

Łukasiewicz three-valued logic Ł3 is often understood as the set of all 3-valued valid formulas according to Łukasiewicz’s 3-valued matrices. Following Wojcicki, in addition, we shall consider two alternative interpretations of Ł3: “well-determined” Ł3a and “truth-preserving” Ł3b defined by two different consequence relations on the 3-valued matrices. The aim of this paper is to provide dual equivalent two-valued under-determined and over-determined interpretations for Ł3, Ł3a and Ł3b. The logic Ł3 is axiomatized as an extension of Routley and Meyer’s basic (...) positive logic following Brady’s strategy for axiomatizing many-valued logics by employing two-valued under-determined or over-determined interpretations. Finally, it is proved that “well determined” Łukasiewicz logics are paraconsistent. (shrink)

Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Refining the method of diagrams we give a solution to an open problem of Hájek and Cintula (J Symb Log 71(3):863–880, 2006, Conjectures 1 and 2). We investigate also the properties of elementary extensions in witnessed and quasi-witnessed theories, generalizing some results of Section 7 of Hájek and Cintula (J Symb (...) Log 71(3):863–880, 2006) and of Section 4 of Cerami and Esteva (Arch Math Log 50(5/6):625–641, 2011) to non-exhaustive models. (shrink)

We present statements equivalent to some fragments of the principle of non-deterministic inductive definitions (NID) by van den Berg (2013), working in a weak subsystem of constructive set theory CZF. We show that several statements in constructive topology which were initially proved using NID are equivalent to the elementary and finitary NIDs. We also show that the finitary NID is equivalent to its binary fragment and that the elementary NID is equivalent to a variant of NID based on the notion (...) of biclosed subset. Our result suggests that proving these statements in constructive topology requires genuine extensions of CZF with the elementary or finitary NID. (shrink)

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We examine the complexity of this equivalence relation for various partial orders, focusing on Cohen and random forcing. We prove, among other results, that the former is an increasing union of countably many hyperfinite Borel equivalence relations, and (...) hence is amenable, while the latter is neither amenable nor treeable. (shrink)

We introduce the notion of τ-like partial order, where τ is one of the linear order types ω, ω*, ω + ω*, and ζ. For example, being ω-like means that every element has finitely many predecessors, while being ζ-like means that every interval is finite. We consider statements of the form “any τ-like partial order has a τ-like linear extension” and “any τ-like partial order is embeddable into τ” . Working in the framework of reverse mathematics, we show that (...) these statements are equivalent either to equation image or to equation image over the usual base system equation image. (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)

A cornerstone of physics, Maxwell‘s theory of electromagnetism, apparently contains a fatal flaw. The standard expressions for the electromagnetic field energy and the self-mass of an electron of finite extension do not obey Einstein‘s famous equation, \, but instead fulfill this relation with a factor 4/3 on the left-hand side. Furthermore, the energy and momentum of the electromagnetic field associated with the charge fail to transform as a four-vector. Many famous physicists have contributed to the debate of this so-called (...) 4/3-problem without arriving at a complete solution. It has generally been assumed that, as originally suggested by Poincaré, the problems are connected to the question of stability of the charge distribution, and that relativistic equivalence between energy and self-mass can only be restored by inclusion of stabilizing forces. Alternative solutions to the problems have also been proposed. Nearly a century ago Fermi suggested a covariant definition of the electromagnetic energy and momentum, and sixty years later Kalckar et al. argued that the 4/3 problem is caused by omission of a relativistic correction in the standard evaluation of the self-force from Coulomb self-interaction. However, the relation between these suggestions has not been clear. We show that the relativistic correction implies that the mechanical momentum of an accelerated rigid body must be defined as the sum of the momenta of its parts for fixed time in the momentary rest frame of the body. For the total momentum of particles and field to be conserved, the total energy–momentum tensor must be divergence free, and this then requires that the momentum of the associated electromagnetic field be defined in the same way, consistent with the suggestion by Fermi. This comprehensive solution of the 4/3-problem demonstrates that there is no conflict of Maxwell‘s theory with special relativity and the questions of equivalence of electromagnetic energy and self-mass and of stability of a classical charge distribution are independent. In appendices we discuss the relations of our treatment with Fermi‘s seminal paper and with a classic paper by Dirac where he evaluated the damping self-force on a point electron from transport of energy and momentum in the electromagnetic field. (shrink)

An ω-model (a model in which all natural numbers are standard) of the predicative fragment of Quine's set theory "New Foundations" (NF) is constructed. Marcel Crabbe has shown that a theory NFI extending predicative NF is consistent, and the model constructed is actually a model of NFI as well. The construction follows the construction of ω-models of NFU (NF with urelements) by R. B. Jensen, and, like the construction of Jensen for NFU, it can be used to construct α-models for (...) any ordinal α. The construction proceeds via a model of a type theory of a peculiar kind; we first discuss such "tangled type theories" in general, exhibiting a "tangled type theory" (and also an extension of Zermelo set theory with Δ 0 comprehension) which is equiconsistent with NF (for which the consistency problem seems no easier than the corresponding problem for NF (still open)), and pointing out that "tangled type theory with urelements" has a quite natural interpretation, which seems to provide an explanation for the more natural behaviour of NFU relative to the other set theories of this kind, and can be seen anachronistically as underlying Jensen's consistency proof for NFU. (shrink)

The technical contribution of this paper is threefold.First we show how to encode functionals in a ‘flat’ applicative structure by adding oracles to untyped λ-calculus and mimicking the applicative behaviour of the functionals with an impredicatively defined reduction relation. The main achievement here is a Church-Rosser result for the extended reduction relation.Second, by combining the previous result with the model construction based on partial equivalence relations, we show how to extend a λ-closed simple type structure to a model of (...) the polymorphic λ-calculus.Third, we specialize the previous result to a counter model against a simple minimization. This minimization is realized by a bar recursive functional, which contrasts the results of Spector and Girard which imply that the bar recursive functions are exactly those that are definable in the polymorphic λ-calculus. As a spin-off, we obtain directly the non-conservativity of the extensions of Gödel's T with bar recursion, fan functional, and Luckhardt's minimization functional, respectively. For the latter two extensions these results are new. (shrink)

Removing a black hole conic singularity by means of Kruskal representation is equivalent to imposing extensibility on the Kasner–Fronsdal local isometric embedding of the corresponding black hole geometry. Allowing for globally non-trivial embeddings, living in Kaluza–Klein-like M 5 × S 1 (rather than in standard Minkowski M 6 ) and parametrized by some wave number k, extensibility can be achieved for apparently “forbidden” frequencies ω in the range ω 1 (k) ≤ ω ≤ ω 2 (k). As k → 0, (...) ω 1, 2 (0) → ωH (e.g., ωH = 1/4M in the Schwarzschild case) such that the Hawking–Gibbons limit is fully recovered. The various Kruskal sheets are then viewed as slices of the Kaluza–Klein background. Euclidean k discreteness, dictated by imaginary time periodicity, is correlated with flux quantization of the underlying embedding gauge field. (shrink)

In both axiomatic theories and the practice of extensive measurement, it is assumed that a series of replicas of any given object can be found. The replicas give rise to a standard series, the "multiples" of the given object. The numerical value assigned to any object is determined, approximately, by comparisons with members of a suitable standard series. This prescription introduces unspecified errors, if the comparison process is somewhat insensitive, so that "replicas" are not really equivalent. In this paper, it (...) is assumed that the comparison process leads only to a semiorder, which allows for such insensitivity. It is shown that, nevertheless, extensive measurement can be carried out, provided that a certain set of (plausible) axioms is valid. Approximate measures, and their limits of error, can be derived from finite sets of semiorder observations. These approximate measures converge to ratio-scale exact measurement. (shrink)

The requirement of proof-theoretic harmony has played a pivotal role in a number of debates in the philosophy of logic. Different authors have attempted to precisify the notion in different ways. Among these, three proposals have been prominent in the literature: harmony–as–conservative extension, harmony–as–leveling procedure, and Tennant’s harmony–as–deductive equilibrium. In this paper I propose to clarify the logical relationships between these accounts. In particular, I demonstrate that what I call the equivalence conjecture —that these three notions essentially come (...) to the same thing—is erroneous. (shrink)

In a recent paper, Barrett & Halvorson (2016) define a notion of equiva- lence for first-order theories, which they call “Morita Equivalence.” To argue that Morita equivalence is a reasonable measure of “theoretical equivalence,” they make use of the claim that Morita extensions “say no more” than the theories they are extending. The goal of this paper is to challenge this central claim by raising objections to their argument for it and by showing why there is good (...) reason to think that the claim itself is false. In light of these criticisms, this paper develops a natural way for the advocate of Morita equivalence to respond. However, this response makes her criterion equivalent to mutual faithful interpretability, an already well-known and philosophically contentious barometer of theoretical equivalence. (shrink)

Kleene [5] mentions two ways of extending the constructive ordinals. The first is by relativizing the setOof notations for the constructive ordinals, using fundamental sequences which are partial recursive inO. In this way we obtain the setOOwhich provides notations for the ordinals less than ω1O. Continuing the process, the sequenceO,OO,, … and the corresponding ordinalsare obtained. A second possibility is to define higher number classes in which partial recursive functions are used at limit ordinals to provide an “accessibility” mapping from (...) a previously defined number class. The relationship between the ordinals obtained by the two methods of extension has been an open problem. Methods developed in this article are used to show that the two ways of extending the constructive ordinals are equivalent, provided the sets of notations for the higher number classes satisfy certain natural conditions. Equivalence is obtained, not only with respect to ordinals, but also with respect to the forms of the sets of notations for the higher number classes. Specifically, the fundamental fact that the sets of notations for the constructive ordinals are complete Π11sets generalizes to suitably defined higher number classes. As an application we prove that the ordinals of the Addison and Kleene [1] constructive third number class are exactly the ordinals less than ω1Oand the setof notations for their third number class is recursively isomorphic toOO. (shrink)

Within the philosophy of biology, Michael Scriven’s twins has become a well-known thought experiment, due to its being the impetus for various lines of discussion concerning the contentious definition of evolutionary fitness, the distinction between natural selection and genetic drift, and evolutionary environments. As one version of the story goes: two twins who, ex hypothesi, are genotypically and phenotypically the same are located side by side on a mountain. An unfortunate event ensues whereby a lightning strike kills one of the (...) twins, whilst the other twin survives. For added disparity, the surviving twin goes on to proliferate extensively by bearing a large number of offspring. Importantly, it is usually inferred, from the stipulations of the thought experiment, that the twins also have the same evolutionary fitness. The inference is important because the premise that the twins have the same fitness paves way for a number of influential views; most notably, it has led to the propensity interpretation of evolutionary fitness. (shrink)

Olsson and his collaborators have proposed an extension of Belief Revision Theory where an epistemic state is modeled as a triple S=⟨K_,E,A_⟩ , where A_ is a research agenda, i.e. a set of research questions. Contraction and expansion apply to states, and affect the agenda. We propose an alternative characterization of the problem of agenda updating, where research questions are viewed as blueprints for research strategies. We offer a unified solution to this problem, and prove it equivalent to Olsson’s (...) own. We conclude arguing that: (i) our solution makes the idea of ‘minimal change’ in questions and agendas clearer; (ii) can be extended in ways the original theory was not, and may help better realize the aims this theory was proposed for; (iii) unveils some limitations of the initial approach, yet opening a way to overcome them. (shrink)

This paper proposes an extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system. Chaitin's Ω is defined as the probability that the universal self-delimiting Turing machine U halts, and plays a central role in the development of algorithmic information theory. In the theory, there are two equivalent ways to define the program-size complexity H of a given finite binary string s. In the standard way, H is defined as the length of the (...) shortest input string for U to output s. In the other way, the so-called universal probability m is introduced first, and then H is defined as –log2m without reference to the concept of program-size.Mathematically, the statistics of outcomes in a quantum measurement are described by a positive operator-valued measure in the most general setting. Based on the theory of computability structures on a Banach space developed by Pour-El and Richards, we extend the universal probability to an analogue of POVM in an infinite dimensional quantum system, called a universal semi-POVM. We also give another characterization of Chaitin's Ω numbers by universal probabilities. Then, based on this characterization, we propose to define an extension of Ω as a sum of the POVM elements of a universal semi-POVM. The validity of this definition is discussed.In what follows, we introduce an operator version equation image of H in a Hilbert space of infinite dimension using a universal semi-POVM, and study its properties. (shrink)

In a recent article, Barrett & Halvorson define a notion of equivalence for first-order theories, which they call “Morita equivalence.” To argue that Morita equivalence is a reasonable measure of “theoretical equivalence,” they make use of the claim that Morita extensions “say no more” than the theories they are extending. The goal of this article is to challenge this central claim by raising objections to their argument for it and by showing why there is good reason (...) to think that the claim itself is false. In light of these criticisms, this article develops a natural way for the advocate of Morita equivalence to respond. I prove that this response makes her criterion a special case of bi-interpretability, an already well-established barometer of theoretical equivalence. I conclude by providing reasons why the advocate of Morita equivalence should opt for a notion of theoretical equivalence that is defined in terms of interpretability rather than Morita extensions. (shrink)

In this paper we study finitary extensions of the nilpotent minimum logic or equivalently quasivarieties of NM-algebras. We first study structural completeness of NML, we prove that NML is hereditarily almost structurally complete and moreover NM\, the axiomatic extension of NML given by the axiom \^{2}\leftrightarrow ^{2})^{2}\), is hereditarily structurally complete. We use those results to obtain the full description of the lattice of all quasivarieties of NM-algebras which allow us to characterize and axiomatize all finitary extensions of NML.

LetKbe an algebraic number field andIKthe ring of algebraic integers inK. *Kand *IKdenote enlargements ofKandIKrespectively. LetxЄ *K–K. In this paper, we are concerned with algebraic extensions ofKwithin *K. For eachxЄ *K–Kand each natural numberd, YKis defined to be the number of algebraic extensions ofKof degreedwithin *K.xЄ *K–Kis called a Hilbertian element ifYK= 0 for alldЄ N,d> 1; in other words,Khas no algebraic extension within *K. In their paper [2], P. C. Gilmore and A. Robinson proved that the existence of (...) a Hilbertian element is equivalent to Hilbert's irreducibility theorem. In a previous paper [9], we gave many Hilbertian elements of nonstandard integers explicitly, for example, for any nonstandard natural numberω, 2ωPωand 2ω are Hilbertian elements in*Q, where pωis theωth prime number. (shrink)

This article constructs a static model of information acquisition when the agent does not know exactly what pieces of information he is missing. A representation of preferences over information channels and menus of lotteries is shown by adapting the model of unforeseen contingencies by Dekel et al. (Econometrica 69:891–934, 2001; Econometrica 75:591–600, 2007), which is an extension of Kreps (Econometrica 47:565–576, 1979; Economic analysis of markets and games: essays in honor of Frank Hahn, 1992). Also, characterisation of informativeness of (...) an information channel analogous to the one by Blackwell (Ann Math Stud 24:265–272, 1953) is examined in conjunction with the preference for flexibility by applying the structure of Shapley value. (shrink)

The logic BKc1 is the basic constructive logic for weak consistency in the ternary relational semantics without a set of designated points. In this paper, a number of extensions of B Kc1 defined with a propositional falsity constant are defined. It is also proved that weak consistency is not equivalent to negation-consistency or absolute consistency in any logic included in positive contractionless intermediate logic LC plus the constructive negation of BKc1 and the contraposition axioms.

We study a predicate extension of an unbounded real valued propositional logic that has been recently introduced. The latter, in turn, can be regarded as an extension of both the abelian logic and of the propositional continuous logic. Among other results, we prove that our predicate extension satisfies the property of weak completeness (the equivalence between satisfiability and consistency) and, under an additional assumption on the set of premisses, the property of strong completeness (the equivalence (...) between logical consequence and provability). Eventually we discuss some topological properties of the space of types in our logic. (shrink)

We show that for solvable games, the calculation of the strategies which survive iterative elimination of dominated strategies in normal games is equivalent to the calculation of the backward induction outcome of some extensive game. However, whereas the normal game form does not provide information on how to carry out the elimination, the corresponding extensive game does. As a by-product, we conclude that implementation using a subgame perfect equilibrium of an extensive game with perfect information is equivalent to implementation through (...) a solution concept which we call guided iteratively elimination of dominated strategies which requires a uniform order of elimination. Journal of Economic Literature Classifica-. (shrink)

We show that for solvable games, the calculation of the strategies which survive iterative elimination of dominated strategies in normal games is equivalent to the calculation of the backward induction outcome of some extensive game. However, whereas the normal game form does not provide information on how to carry out the elimination, the corresponding extensive game does. As a by-product, we conclude that implementation using a subgame perfect equilibrium of an extensive game with perfect information is equivalent to implementation through (...) a solution concept which we call guided iteratively elimination of dominated strategies which requires a uniform order of elimination. Journal of Economic Literature Classification Number: C72. (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 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)

We show that the maximal linear extension theorem for well partial orders is equivalent over RCA0 to ATR0. Analogously, the maximal chain theorem for well partial orders is equivalent to ATR0 over RCA0.

An attempt is made to include the axioms of Mackey for probabilities of experiments in quantum mechanics into the calculus x0 of ukasiewicz. The obtained calculusQ contains an additional modal signQ and four modal rules of inference. The propositionQx is read x is confirmed. The most specific rule of inference may be read: for comparable observations implication is equivalent to confirmation of material implication.The semantic truth ofQ is established by the interpretation with the help of physical objects obeying to the (...) rules of quantum mechanics. The embedding of the usual quantum propositional logic inQ is accomplished. (shrink)

The proofs of some results of abstract algebraic logic, in particular of the transfer principle of Czelakowski, assume the existence of so-called natural extensions of a logic by a set of new variables. Various constructions of natural extensions, claimed to be equivalent, may be found in the literature. In particular, these include a syntactic construction due to Shoesmith and Smiley and a related construction due to Łoś and Suszko. However, it was recently observed by Cintula and Noguera that both of (...) these constructions fail in the sense that they do not necessarily yield a logic. Here we show that whenever the Łoś–Suszko construction yields a logic, so does the Shoesmith–Smiley construction, but not vice versa. We also describe the smallest and the largest conservative extension of a logic by a set of new variables and show that contrary to some previous claims in the literature, a logic of cardinality \ may have more than one conservative extension of cardinality \ by a set of new variables. In this connection we then correct a mistake in the formulation of a theorem of Dellunde and Jansana. (shrink)