Results for ' Lascar strong types'

1000+ found
Order:
  1.  21
    Lascar strong types in some simple theories.Steven Buechler - 1999 - Journal of Symbolic Logic 64 (2):817-824.
    In this paper a class of simple theories, called the low theories is developed, and the following is proved. Theorem. Let T be a low theory. A set and a, b elements realizing the same strong type over A. Then, a and b realized the same Lascar strong type over A.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  2.  16
    A note on Lascar strong types in simple theories.Byunghan Kim - 1998 - Journal of Symbolic Logic 63 (3):926-936.
    Let T be a countable, small simple theory. In this paper, we prove that for such T, the notion of Lascar strong type coincides with the notion of strong type, over an arbitrary set.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  3.  34
    Borel equivalence relations and Lascar strong types.Krzysztof Krupiński, Anand Pillay & Sławomir Solecki - 2013 - Journal of Mathematical Logic 13 (2):1350008.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  4.  13
    The Lascar Group and the Strong Types of Hyperimaginaries.Byunghan Kim - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):497-507.
    This is an expository note on the Lascar group. We also study the Lascar group over hyperimaginaries and make some new observations on the strong types over those. In particular, we show that in a simple theory $\operatorname{Ltp}\equiv\operatorname{stp}$ in real context implies that for hyperimaginary context.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5.  10
    The relativized Lascar groups, type-amalgamation, and algebraicity.Jan Dobrowolski, Byunghan Kim, Alexei Kolesnikov & Junguk Lee - 2021 - Journal of Symbolic Logic 86 (2):531-557.
    In this paper we study the relativized Lascar Galois group of a strong type. The group is a quasi-compact connected topological group, and if in addition the underlying theory T is G-compact, then the group is compact. We apply compact group theory to obtain model theoretic results in this note. -/- For example, we use the divisibility of the Lascar group of a strong type to show that, in a simple theory, such types have a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Lascar Types and Lascar Automorphisms in Abstract Elementary Classes.Tapani Hyttinen & Meeri Kesälä - 2011 - Notre Dame Journal of Formal Logic 52 (1):39-54.
    We study Lascar strong types and Galois types and especially their relation to notions of type which have finite character. We define a notion of a strong type with finite character, the so-called Lascar type. We show that this notion is stronger than Galois type over countable sets in simple and superstable finitary AECs. Furthermore, we give an example where the Galois type itself does not have finite character in such a class.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  34
    Les beaux automorphismes.Daniel Lascar - 1991 - Archive for Mathematical Logic 31 (1):55-68.
    Assume that the class of partial automorphisms of the monster model of a complete theory has the amalgamation property. The beautiful automorphisms are the automorphisms of models ofT which: 1. are strong, i.e. leave the algebraic closure (inT eq) of the empty set pointwise fixed, 2. are obtained by the Fraïsse construction using the amalgamation property that we have just mentioned. We show that all the beautiful automorphisms have the same theory (in the language ofT plus one unary function (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  8. Automorphisms of a strongly minimal set.D. Lascar - 1992 - Journal of Symbolic Logic 57 (1):238-251.
  9.  61
    Les automorphismes d'un ensemble fortement minimal.Daniel Lascar - 1992 - Journal of Symbolic Logic 57 (1):238-251.
    Let M be a countable saturated structure, and assume that D(ν) is a strongly minimal formula (without parameter) such that M is the algebraic closure of D(M). We will prove the two following theorems: Theorem 1. If G is a subgroup of $\operatorname{Aut}(\mathfrak{M})$ of countable index, there exists a finite set A in M such that every A-strong automorphism is in G. Theorem 2. Assume that G is a normal subgroup of $\operatorname{Aut}(\mathfrak{M})$ containing an element g such that for (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  76
    Cloning and Infertility.Carson Strong - 1998 - Cambridge Quarterly of Healthcare Ethics 7 (3):279-293.
    Although there are important moral arguments against cloning human beings, it has been suggested that there might be exceptional cases in which cloning humans would be ethically permissible. One type of supposed exceptional case involves infertile couples who want to have children by cloning. This paper explores whether cloning would be ethically permissible in infertility cases and the separate question of whether we should have a policy allowing cloning in such cases. One caveat should be stated at the beginning, however. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  11.  8
    From the University of California Psychological Laboratory: The effect of various types of suggestion upon muscular activity.Edward Strong - 1910 - Psychological Review 17 (4):279-293.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12.  72
    Vico's Science of Imagination (review).Edward W. Strong - 1983 - Journal of the History of Philosophy 21 (2):273-275.
    In lieu of an abstract, here is a brief excerpt of the content:BOOK REVIEWS 273 Verene, Donald Phillip. Vico's Science of Imagination. Ithaca, New York: Cornell University Press, 1981, Pp. 227. $19.5o. In Chapter 1 (Introduction: Vico's Originality), Verene announces two principal concerns, a two-fold approach, and the predominant contention of his study.. 1. Principal concerns: "to consider the philosophical truth of Vico's ideas themselves, rather than to examine their historical character" (p. 19); to consider "the importance of Vico's conception (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  13.  76
    Abortion decisions as inclusion and exclusion criteria in research involving pregnant women and fetuses.Carson Strong - 2012 - Journal of Medical Ethics 38 (1):43-47.
    From the perspective of investigators conducting research involving pregnant women and fetuses, a woman's decision about whether to have an abortion can sometimes be relevant to the suitability of the woman and fetus as research subjects. However, prominent ethicists disagree over whether it is permissible for a woman's decision about abortion to be an inclusion or exclusion criterion for participation in research. A widely held view is that fetuses to be aborted and fetuses to be carried to term should be (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  14.  45
    Harming by conceiving: A review of misconceptions and a new analysis. [REVIEW]Carson Strong - 2005 - Journal of Medicine and Philosophy 30 (5):491 – 516.
    An objection often is raised against the use of reproductive technology to create "nontraditional families," as in ovum donation for postmenopausal women or postmortem artificial insemination. The objection states that conceiving children in such circumstances is harmful to them because of adverse features of these nontraditional families. A similar objection is raised when parents, through negligence or willful disregard of risks, create children with serious genetic diseases or other developmental handicaps. It is claimed that such reproduction harms the children who (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  15.  9
    Non-isolated types in stable theories.Predrag Tanović - 2007 - Annals of Pure and Applied Logic 145 (1):1-15.
    We introduce notions of strong and eventual strong non-isolation for types in countable, stable theories. For T superstable or small stable we prove a dichotomy theorem: a regular type over a finite domain is either eventually strongly non-isolated or is non-orthogonal to a NENI type . As an application we obtain the upper bound for Lascar’s rank of a superstable theory which is one-based or trivial, and has fewer than 20 non-isomorphic countable models.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  22
    Simplicity and uncountable categoricity in excellent classes.Tapani Hyttinen & Olivier Lessmann - 2006 - Annals of Pure and Applied Logic 139 (1):110-137.
    We introduce Lascar strong types in excellent classes and prove that they coincide with the orbits of the group generated by automorphisms fixing a model. We define a new independence relation using Lascar strong types and show that it is well-behaved over models, as well as over finite sets. We then develop simplicity and show that, under simplicity, the independence relation satisfies all the properties of nonforking in a stable first order theory. Further, simplicity (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  17.  14
    Independence over arbitrary sets in NSOP1 theories.Jan Dobrowolski, Byunghan Kim & Nicholas Ramsey - 2022 - Annals of Pure and Applied Logic 173 (2):103058.
    We study Kim-independence over arbitrary sets. Assuming that forking satisfies existence, we establish Kim's lemma for Kim-dividing over arbitrary sets in an NSOP1 theory. We deduce symmetry of Kim-independence and the independence theorem for Lascar strong types.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  18.  14
    Transitivity, Lowness, and Ranks in Nsop Theories.Artem Chernikov, K. I. M. Byunghan & Nicholas Ramsey - 2023 - Journal of Symbolic Logic 88 (3):919-946.
    We develop the theory of Kim-independence in the context of NSOP $_{1}$ theories satisfying the existence axiom. We show that, in such theories, Kim-independence is transitive and that -Morley sequences witness Kim-dividing. As applications, we show that, under the assumption of existence, in a low NSOP $_{1}$ theory, Shelah strong types and Lascar strong types coincide and, additionally, we introduce a notion of rank for NSOP $_{1}$ theories.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  15
    On Amalgamation in NTP2 Theories and Generically Simple Generics.Pierre Simon - 2020 - Notre Dame Journal of Formal Logic 61 (2):233-243.
    We prove a couple of results on NTP2 theories. First, we prove an amalgamation statement and deduce from it that the Lascar distance over extension bases is bounded by 2. This improves previous work of Ben Yaacov and Chernikov. We propose a line of investigation of NTP2 theories based on S1 ideals with amalgamation and ask some questions. We then define and study a class of groups with generically simple generics, generalizing NIP groups with generically stable generics.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  20.  10
    Simple almost hyperdefinable groups.Itaï Ben-Yaacov - 2006 - Journal of Mathematical Logic 6 (01):69-88.
    We lay down the groundwork for the treatment of almost hyperdefinable groups: notions from [5] are put into a natural hierarchy, and new notions, essential to the study to such groups, fit elegantly into this hierarchy. We show that "classical" properties of definable and hyperdefinable groups in simple theories can be generalised to this context. In particular, we prove the existence of stabilisers of Lascar strong types and of the connected and locally connected components of subgroups, and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  21.  26
    On Almost Orthogonality in Simple Theories.Itay Ben-Yaacov & Frank O. Wagner - 2004 - Journal of Symbolic Logic 69 (2):398 - 408.
    1. We show that if p is a real type which is internal in a set $\sigma$ of partial types in a simple theory, then there is a type p' interbounded with p, which is finitely generated over $\sigma$ , and possesses a fundamental system of solutions relative to $\sigma$ . 2. If p is a possibly hyperimaginary Lascar strong type, almost \sigma-internal$ , but almost orthogonal to $\sigma^{\omega}$ , then there is a canonical non-trivial almost hyperdefinable (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  22.  27
    Some remarks on indiscernible sequences.Enrique Casanovas - 2003 - Mathematical Logic Quarterly 49 (5):475-478.
    We prove a property of generic homogeneity of tuples starting an infinite indiscernible sequence in a simple theory and we use it to give a shorter proof of the Independence Theorem for Lascar strong types. We also characterize the relation of starting an infinite indiscernible sequence in terms of coheirs.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  20
    Galois groups as quotients of Polish groups.Krzysztof Krupiński & Tomasz Rzepecki - 2020 - Journal of Mathematical Logic 20 (3):2050018.
    We present the (Lascar) Galois group of any countable theory as a quotient of a compact Polish group by an F_σ normal subgroup: in general, as a topological group, and under NIP, also in terms of Borel cardinality. This allows us to obtain similar results for arbitrary strong types defined on a single complete type over ∅. As an easy conclusion of our main theorem, we get the main result of [K. Krupiński, A. Pillay and T. Rzepecki, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  77
    Nobility and Decadence: The Vulnerabilities of Nietzsche’s Strong Type.Vinod Acharya - 2012 - PhaenEx 7 (1):130-161.
    This paper argues that for Nietzsche it is only when the strong type decays on its own terms that it is possible for a weak type to come into dominance by inverting the values of the strong. It sets right a latent inconsistency in Deleuze’s work, Nietzsche and Philosophy , which traces back the origin of decadence to the subterranean struggle between reactive forces. I show that Deleuze’s reading runs contrary to his own contention that for Nietzsche the (...)
    Direct download (14 more)  
     
    Export citation  
     
    Bookmark  
  25. G-compactness and groups.Jakub Gismatullin & Ludomir Newelski - 2008 - Archive for Mathematical Logic 47 (5):479-501.
    Lascar described E KP as a composition of E L and the topological closure of E L (Casanovas et al. in J Math Log 1(2):305–319). We generalize this result to some other pairs of equivalence relations. Motivated by an attempt to construct a new example of a non-G-compact theory, we consider the following example. Assume G is a group definable in a structure M. We define a structure M′ consisting of M and X as two sorts, where X is (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  26.  37
    Strong Normalizability of Typed Lambda-Calculi for Substructural Logics.Motohiko Mouri & Norihiro Kamide - 2008 - Logica Universalis 2 (2):189-207.
    The strong normalization theorem is uniformly proved for typed λ-calculi for a wide range of substructural logics with or without strong negation.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27.  43
    A Strong and Rich 4-Valued Modal Logic Without Łukasiewicz-Type Paradoxes.José M. Méndez & Gemma Robles - 2015 - Logica Universalis 9 (4):501-522.
    The aim of this paper is to introduce an alternative to Łukasiewicz’s 4-valued modal logic Ł. As it is known, Ł is afflicted by “Łukasiewicz type paradoxes”. The logic we define, PŁ4, is a strong paraconsistent and paracomplete 4-valued modal logic free from this type of paradoxes. PŁ4 is determined by the degree of truth-preserving consequence relation defined on the ordered set of values of a modification of the matrix MŁ characteristic for the logic Ł. On the other hand, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  28.  13
    Strong density of definable types and closed ordered differential fields.Quentin Brouette, Pablo Cubides Kovacsics & Françoise Point - 2019 - Journal of Symbolic Logic 84 (3):1099-1117.
    The following strong form of density of definable types is introduced for theoriesTadmitting a fibered dimension functiond: given a modelMofTand a definable setX⊆Mn, there is a definable typepinX, definable over a code forXand of the samed-dimension asX. Both o-minimal theories and the theory of closed ordered differential fields are shown to have this property. As an application, we derive a new proof of elimination of imaginaries for CODF.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29.  43
    Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (3):652-660.
    In this paper a model for barrecursion is presented. It has as a novelty that it contains discontinuous functionals. The model is based on a concept called strong majorizability. This concept is a modification of Howard's majorizability notion; see [T, p. 456].
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   36 citations  
  30.  43
    Strongly determined types.Alexandre A. Ivanov & Dugald Macpherson - 1999 - Annals of Pure and Applied Logic 99 (1-3):197-230.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  31.  25
    Strong Normalization and Typability with Intersection Types.Silvia Ghilezan - 1996 - Notre Dame Journal of Formal Logic 37 (1):44-52.
    A simple proof is given of the property that the set of strongly normalizing lambda terms coincides with the set of lambda terms typable in certain intersection type assignment systems.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  32.  26
    Strong normalization in type systems: A model theoretical approach.Jan Terlouw - 1995 - Annals of Pure and Applied Logic 73 (1):53-78.
    Tait's proof of strong normalization for the simply typed λ-calculus is interpreted in a general model theoretical framework by means of the specification of a certain theory T and a certain model /oU of T. The argumentation is partly reduced to formal predicate logic by the application of certain derivability properties of T. The resulting version of Tait's proof is, within the same framework, systematically generalized to the Calculus of Constructions and other advanced type systems. The generalization proceeds along (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  33.  20
    Strong storage operators and data types.Karim Nour - 1995 - Archive for Mathematical Logic 34 (1):65-78.
    The storage operators were introduced by J.L. Krivine ([6]); they are closed λ-terms which, for some fixed data type (the integers for example), allow to simulate “call by value” while using “call by name”. J.L. Krivine showed that such operators can be typed, in the type system, using Gödel's translation from classical to intuitionistic logic ([8]).This paper studies the existence of storage operators which give a normal form as result (strong storage operators) for recursive and iterative representation of data (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  3
    Omitting types in expansions and related strong saturation properties.Fredrik Engström - 2003 - Bulletin of Symbolic Logic 10 (2).
  35. The strong, silent type: Alice's use of rhetorical silence as feminist strategy.Suzan E. Aiken - 2014 - In Nadine Farghaly (ed.), Unraveling Resident Evil: essays on the complex universe of the games and films. Jefferson, North Carolina: McFarland & Company, Inc., Publishers.
    No categories
     
    Export citation  
     
    Bookmark  
  36.  22
    HSP-type Characterization of Strong Equational Classes of Partial Algebras.Bogdan Staruch - 2009 - Studia Logica 93 (1):41-65.
    This paper presents the first purely algebraic characterization of classes of partial algebras definable by a set of strong equations. This result was posible due to new tools such as invariant congruences, i.e. a generalization of the notion of a fully invariant congruence, and extension of algebras, specific for strong equations.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37.  15
    A strong multi-typed intuitionistic theory of functionals.Farida Kachapova - 2015 - Journal of Symbolic Logic 80 (3):1035-1065.
  38. Strong normalization of a typed lambda calculus for intuitionistic bounded linear-time temporal logic.Norihiro Kamide - 2012 - Reports on Mathematical Logic:29-61.
     
    Export citation  
     
    Bookmark  
  39.  31
    Strong normalization for typed terms with surjective pairing.A. S. Troelstra - 1986 - Notre Dame Journal of Formal Logic 27 (4):547-550.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  40.  45
    On Lascar rank and Morley rank of definable groups in differentially closed fields.Anand Pillay & Wai Yan Pong - 2002 - Journal of Symbolic Logic 67 (3):1189-1196.
    Morley rank and Lascar rank are equal on generic types of definable groups in differentially closed fields with finitely many commuting derivations.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  41.  26
    An elementary proof of strong normalization for intersection types.Valentini Silvio - 2001 - Archive for Mathematical Logic 40 (7):475-488.
    We provide a new and elementary proof of strong normalization for the lambda calculus of intersection types. It uses no strong method, like for instance Tait-Girard reducibility predicates, but just simple induction on type complexity and derivation length and thus it is obviously formalizable within first order arithmetic. To obtain this result, we introduce a new system for intersection types whose rules are directly inspired by the reduction relation. Finally, we show that not only the set (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  9
    Classifying spaces and the Lascar group.Tim Campion, Greg Cousins & Jinhe Ye - 2021 - Journal of Symbolic Logic 86 (4):1396-1431.
    We show that the Lascar group $\operatorname {Gal}_L$ of a first-order theory T is naturally isomorphic to the fundamental group $\pi _1|)$ of the classifying space of the category of models of T and elementary embeddings. We use this identification to compute the Lascar groups of several example theories via homotopy-theoretic methods, and in fact completely characterize the homotopy type of $|\mathrm {Mod}|$ for these theories T. It turns out that in each of these cases, $|\operatorname {Mod}|$ is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  67
    McAloon K.. Introduction. Modèles de l'arithmétique, Séminaire Paris VII, edited by McAloon K., Asterisque, no. 73, Société Mathématique de France, Paris 1980, pp. 1–2.Kirby L. A. S.. La méthode des indicatrices et le théorème d'incomplétude. Modèles de l'arithmétique, Séminaire Paris VII, edited by McAloon K., Asterisque, no. 73, Société Mathématique de France, Paris 1980, pp. 5–18.Lascar Daniel. Une indicatrice de type “Ramsey” pour l'arithmétique de Peano et la formule de Paris-Harrington. Modèles de l'arithmétique, Séminaire Paris VII, edited by McAloon K., Asterisque, no. 73, Société Mathématique de France, Paris 1980, 19–30.McAloon Kenneth. Les rapports entre la méthode des indicatrices et la méthode de Gödel pour obtenir des résultats d'indépendance. Modèles de l'arithmétique, Séminaire Paris VII, edited by McAloon K., Asterisque, no. 73, Société Mathématique de France, Paris 1980, pp. 31–39.McAloon Kenneth. Progressions transfinies de théories axiomatiques, formes combinatoires. [REVIEW]J. B. Paris - 1983 - Journal of Symbolic Logic 48 (2):483-484.
  44.  35
    Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing.Steffen van Bakel - 2004 - Notre Dame Journal of Formal Logic 45 (1):35-63.
    This paper defines reduction on derivations (cut-elimination) in the Strict Intersection Type Assignment System of an earlier paper and shows a strong normalization result for this reduction. Using this result, new proofs are given for the approximation theorem and the characterization of normalizability of terms using intersection types.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  20
    EF4, EF4-M and EF4-Ł: A companion to BN4 and two modal four-valued systems without strong Łukasiewicz-type modal paradoxes. [REVIEW]José Miguel Blanco - forthcoming - Logic and Logical Philosophy:75-104.
    The logic BN4 was defined by R.T. Brady as a four-valued extension of Routley and Meyer’s basic logic B. The system EF4 is defined as a companion to BN4 to represent the four-valued system of implication. The system Ł was defined by J. Łukasiewicz and it is a four-valued modal logic that validates what is known as strong Łukasiewicz-type modal paradoxes. The systems EF4-M and EF4-Ł are defined as alternatives to Ł without modal paradoxes. This paper aims to define (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  46.  16
    Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation.Gemma Robles & José M. Méndez - 2021 - Journal of Applied Non-Classical Logics 31 (2):130-153.
    Let MK3 I and MK3 II be Kleene's strong 3-valued matrix with only one and two designated values, respectively. Next, let MK3 G be defined exactly as MK3 I, except th...
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  47.  12
    On ω-strongly measurable cardinals in ℙmax extensions.Navin Aksornthong, Takehiko Gappo, James Holland & Grigor Sargsyan - forthcoming - Journal of Mathematical Logic.
    We show that in the [Formula: see text] extension of a certain Chang-type model of determinacy, if [Formula: see text], then the restriction of the club filter on [Formula: see text] Cof[Formula: see text] to HOD is an ultrafilter in HOD. This answers Question 4.11 of [O. Ben-Neria and Y. Hayut, On [Formula: see text]-strongly measurable cardinals, Forum Math. Sigma 11 (2023) e19].
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  48.  19
    An Implicative Expansion of Belnap’s Four-Valued Matrix: A Modal Four-Valued Logic Without Strong Modal Lukasiewicz-Type Paradoxes.José Miguel Blanco - 2020 - Bulletin of Symbolic Logic 26 (3-4):297-298.
  49. The Strong and Weak Senses of Theory-Ladenness of Experimentation: Theory-Driven versus Exploratory Experiments in the History of High-Energy Particle Physics.Koray Karaca - 2013 - Science in Context 26 (1):93-136.
    ArgumentIn the theory-dominated view of scientific experimentation, all relations of theory and experiment are taken on a par; namely, that experiments are performed solely to ascertain the conclusions of scientific theories. As a result, different aspects of experimentation and of the relations of theory to experiment remain undifferentiated. This in turn fosters a notion of theory-ladenness of experimentation (TLE) that is toocoarse-grainedto accurately describe the relations of theory and experiment in scientific practice. By contrast, in this article, I suggest that (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  50.  16
    | T|+‐resplendent models and the Lascar group.Enrique Casanovas & Rodrigo Peláez - 2005 - Mathematical Logic Quarterly 51 (6):626-631.
    In this paper we show that in every |T |+-resplendent model N , for every A ⊆ N such that |A | ≤ |T |, the group Autf of strong automorphisms is the least very normal subgroup of the group Aut and the quotient Aut/Autf is the Lascar group over A . Then we generalize this result to every |T |+-saturated and strongly |T |+-homogeneous model.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 1000