Results for 'domination reducibility'

999 found
Order:
  1.  28
    Almost Everywhere Domination and Superhighness.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):462-482.
    Let ω be the set of natural numbers. For functions f, g: ω → ω, we say f is dominated by g if f < g for all but finitely many n ∈ ω. We consider the standard “fair coin” probability measure on the space 2ω of in-finite sequences of 0's and 1's. A Turing oracle B is said to be almost everywhere dominating if, for measure 1 many X ∈ 2ω, each function which is Turing computable from X is (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  2.  9
    The Settling-Time Reducibility Ordering.Barbara F. Csima & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (3):1055 - 1071.
    To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a number less than or equal to x was enumerated into A. One c.e. set A is settling time dominated by another set B (B >st A) if for every computable function f, for all but finitely many x, mB(x) > f(m₄(x)). This settling-time ordering, which is a natural extension to an ordering of the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  1
    Effective Domination and the Bounded Jump.Keng Meng Ng & Hongyuan Yu - 2020 - Notre Dame Journal of Formal Logic 61 (2):203-225.
    We study the relationship between effective domination properties and the bounded jump. We answer two open questions about the bounded jump: We prove that the analogue of Sacks jump inversion fails for the bounded jump and the wtt-reducibility. We prove that no c.e. bounded high set can be low by showing that they all have to be Turing complete. We characterize the class of c.e. bounded high sets as being those sets computing the Halting problem via a reduction (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  10
    Regular Reals.Guohua Wu - 2005 - Mathematical Logic Quarterly 51 (2):111-119.
    Say that α is an n-strongly c. e. real if α is a sum of n many strongly c. e. reals, and that α is regular if α is n-strongly c. e. for some n. Let Sn be the set of all n-strongly c. e. reals, Reg be the set of regular reals and CE be the set of c. e. reals. Then we have: S1 ⊂ S2 ⊂ · · · ⊂ Sn ⊂ · · · ⊂ ⊂ Reg (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5.  11
    Continuous Reducibility and Dimension of Metric Spaces.Philipp Schlicht - 2018 - Archive for Mathematical Logic 57 (3-4):329-359.
    If is a Polish metric space of dimension 0, then by Wadge’s lemma, no more than two Borel subsets of X are incomparable with respect to continuous reducibility. In contrast, our main result shows that for any metric space of positive dimension, there are uncountably many Borel subsets of that are pairwise incomparable with respect to continuous reducibility. In general, the reducibility that is given by the collection of continuous functions on a topological space \\) is called (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  30
    Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
  7.  22
    Borel Reducibility and Hölder(Α) Embeddability Between Banach Spaces.Longyun Ding - 2012 - Journal of Symbolic Logic 77 (1):224-244.
    We investigate Borel reducibility between equivalence relations $E(X;p)=X^{\mathbb{N}}/\ell_{p}(X)'s$ where X is a separable Banach space. We show that this reducibility is related to the so called Hölder(α) embeddability between Banach spaces. By using the notions of type and cotype of Banach spaces, we present many results on reducibility and unreducibility between E(L r ; p)'s and E(c 0 ; p)'s for r, p ∈ [1, +∞). We also answer a problem presented by Kanovei in the affirmative by (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  13
    Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
  9. Domination: A Rethinking.Christopher McCammon - 2015 - Ethics 125 (4):1028-1052.
    Sometimes dictators are benevolent. Sometimes masters are kind and gentle to their slaves. John Adams was a pretty good "husband" to Abigail Adams. But it seems like there’s something very wrong with being a dictator or a master or a spouse with the power that John Adams had over Abigail Adams in late 18th Century America. A theory of domination tries to pinpoint what’s distinctive about dictatorship and mastery and traditional husbanding, and what is distinctively wrong with such—even the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  10.  74
    Supervenience, Necessary Coextensions, and Reducibility.John Bacon - 1986 - Philosophical Studies 49 (March):163-76.
    Supervenience in most of its guises entails necessary coextension. Thus theoretical supervenience entails nomically necessary coextension. Kim's result, thus strengthened, has yet to hit home. I suspect that many supervenience enthusiasts would cool at necessary coextension: they didn't mean to be saying anything quite so strong. Furthermore, nomically necessary coextension can be a good reason for property identification, leading to reducibility in principle. This again is more than many supervenience theorists bargained for. They wanted supervenience without reducibility. It (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  11.  32
    Borel Reducibility and Finitely Hölder (Α) Embeddability.Longyun Ding - 2011 - Annals of Pure and Applied Logic 162 (12):970-980.
    Let , be a sequence of pseudo-metric spaces, and let p≥1. For , let . For Borel reducibility between equivalence relations , we show it is closely related to finitely Hölder embeddability between pseudo-metric spaces.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12.  78
    Domination and Migration: An Alternative Approach to the Legitimacy of Migration Controls.Iseult Honohan - 2014 - Critical Review of International Social and Political Philosophy 17 (1):31-48.
    Freedom as non-domination provides a distinctive criterion for assessing the justifiability of migration controls, different from both freedom of movement and autonomy. Migration controls are dominating insofar as they threaten to coerce potential migrants. Both the general right of states to control migration, and the wide range of discretionary procedures prevalent in migration controls, render outsiders vulnerable to arbitrary power. While the extent and intensity of domination varies, it is sufficient under contemporary conditions of globalization to warrant limits (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  13.  46
    Liar, Reducibility and Language.Pierdaniele Giaretta - 1998 - Synthese 117 (3):355-374.
    First, language and axioms of Church's paper 'Comparison of Russell's Resolution of the Semantical Antinomies with that of Tarski' are slightly modified and a version of the Liar paradox tentatively reconstructed. An obvious natural solution of the paradox leads to a hierarchy of truth predicates which is of a different kind from the one defined by Church: it depends on the enlargement of the semantical vocabulary and its levels do not differ in the ramified-type-theoretical sense. Second, two attempts are made (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  14.  19
    Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  15.  3
    Enumeration Reducibility and Partial Degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
  16.  9
    Reducibility Orderings: Theories, Definability and Automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
  17. Rosenberg, Reducibility and Consciousness.William E. Seager - 2006 - PSYCHE: An Interdisciplinary Journal of Research On Consciousness 12.
    Rosenberg’s general argumentative strategy in favour of panpsychism is an extension of a traditional pattern. Although his argument is complex and intricate, I think a model that is historically significant and fundamentally similar to the position Rosenberg advances might help us understand the case for panpsychism. Thus I want to begin by considering a Leibnizian argument for panpsychism.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  18.  38
    A Borel Reducibility Theory for Classes of Countable Structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.
    We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to class). Though we sometimes work in a slightly larger context, we are principally concerned with the case where each class is an invariant Borel class (i.e. the class of all models, with underlying set $= \omega$, of an $L_{\omega_1\omega}$ sentence; from this point of view, the reducibility can be thought of (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  19.  5
    Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Mathematical Logic Quarterly 33 (6):537-560.
  20.  28
    Domination.Christopher McCammon - 2018 - Stanford Encyclopedia of Philosophy.
    Theories of domination are primarily attempts to understand the value of justice, freedom, and equality by examining cases where they are absent. Such theories seek to clarify and systematize our judgments about what it is to be weak against uncontrolled strength, i.e., about what it is to be vulnerable, degraded, and defenseless against unrestrained power. -/- Much contemporary disagreement about domination involves competing answers to three questions: (1) Who, or what, can dominate? (2) Is it possible to dominate (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  7
    Coarse Reducibility and Algorithmic Randomness.Denis R. Hirschfeldt, Carl G. Jockusch, Rutger Kuyper & Paul E. Schupp - 2016 - Journal of Symbolic Logic 81 (3):1028-1046.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  22.  51
    The Domination of Nature.William Leiss - 1972 - Boston: Beacon Press.
    In Part One Leiss traces the idea of the domination of nature from the Renaissance to the nineteenth century.
    Direct download  
     
    Export citation  
     
    Bookmark   30 citations  
  23.  41
    Monotone Reducibility and the Family of Infinite Sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
    Let A and B be subsets of the space 2 N of sets of natural numbers. A is said to be Wadge reducible to B if there is a continuous map Φ from 2 N into 2 N such that A = Φ -1 (B); A is said to be monotone reducible to B if in addition the map Φ is monotone, that is, $a \subset b$ implies $\Phi (a) \subset \Phi(b)$ . The set A is said to be monotone (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  21
    Effective Borel Measurability and Reducibility of Functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.
    The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single-valued as well as for multi-valued functions by a direct effectivization of the classical definition. On Baire space the finite levels of the resulting hierarchy of functions can be characterized using a notion of reducibility for functions and corresponding complete (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  25.  86
    On the Logic of Reducibility: Axioms and Examples. [REVIEW]Karl-Georg Niebergall - 2000 - Erkenntnis 53 (1-2):27-61.
    This paper is an investigation into what could be a goodexplication of ``theory S is reducible to theory T''''. Ipresent an axiomatic approach to reducibility, which is developedmetamathematically and used to evaluate most of the definitionsof ``reducible'''' found in the relevant literature. Among these,relative interpretability turns out to be most convincing as ageneral reducibility concept, proof-theoreticalreducibility being its only serious competitor left. Thisrelation is analyzed in some detail, both from the point of viewof the reducibility axioms and (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  26. Domination, Epistemic Injustice and Republican Epistemology.James Bohman - 2012 - Social Epistemology 26 (2):175-187.
    With her conception of epistemic injustice, Miranda Fricker has opened up new normative dimensions for epistemology; that is, the injustice of denying one?s status as a knower. While her analysis of the remedies for such injustices focuses on the epistemic virtues of agents, I argue for the normative superiority of adapting a broadly republican conception of epistemic injustice. This argument for a republican epistemology has three steps. First, I focus on methodological and explanatory issues of identifying epistemic injustice and argue, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  27.  31
    The Domination of States: Towards an Inclusice Republican Law of Peoples.Dorothea Gaedeke - 2016 - Global Justice : Theory Practice Rhetoric 9 (1).
    Abstract: The article aims to sharpen the neo-republican contribution to international political thought by challenging Pettit’s view that only representative states may raise a valid claim to non-domination in their external relations. The argument proceeds in two steps: First I show that, conceptually speaking, the domination of states, whether representative or not, implies dominating the collective people at least in its fundamental, constitutive power. Secondly, the domination of states – and thus of their peoples – cannot be (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  32
    Systemic Domination as Ground of Justice.Jugov Tamara - 2020 - European Journal of Political Theory 19 (1).
    This paper develops a domination-based practice-dependent approach to justice, according to which it is practices of systemic domination which can be said to ground demands from justice. The domination-based approach developed overcomes the two most important objections levelled to alternative practice-dependent approaches. First, it eschews conservative implications and hence is immune to the status quo objection. Second, it is immune to the redundancy objection, which doubts whether empirical facts and practices can really play an irreducible role in (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29.  89
    Domination Across Borders: An Introduction.Barbara Buckinx, Jonathan Trejo-Mathys & Timothy Waligore - 2015 - In Barbara Buckinx, Jonathan Trejo-Mathys & Timothy Waligore (eds.), Domination and Global Political Justice: Conceptual, Historical and Institutional Perspectives. New York: Routledge. pp. 1-33.
    This chapter explores the different dimensions of domination, including whether it has a structural approach, its relation to race and imperialism, and how non-domination can be institutionalized and achieved at a global level.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  19
    1-Reducibility Inside an M-Degree with Maximal Set.E. Herrmann - 1992 - Journal of Symbolic Logic 57 (3):1046-1056.
    The structure of the l-degrees included in an m-degree with a maximal set together with the l-reducibility relation is characterized. For this a special sublattice of the lattice of recursively enumerable sets under the set-inclusion is used.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  36
    Introduction: Domination, Migration and Non-Citizens.Iseult Honohan & Marit Hovdal-Moan - 2014 - Critical Review of International Social and Political Philosophy 17 (1):1-9.
    In Europe and other regions of the world public debate concerning how many immigrants should be admitted, which rights those admitted should have, and which conditions can be required for access to citizenship is intense and enduring, and these have increasingly become central electoral issues. On the one hand, the harsh treatment of migrants is often a matter of public criticism; on the other hand, states are concerned about problems of welfare, security and social unrest that they have come to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  32.  91
    Non-Domination and the Ethics of Migration.Sarah Fine - 2014 - In Iseult Honohan & Marit Hovdal-Moan (eds.), Domination, Migration and Non-Citizens. Routledge. pp. 10-30.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  33.  84
    Domination: A Preliminary Analysis.Francis N. Lovett - 2001 - The Monist 84 (1):98-112.
    The recent revival of civic republicanism has been grounded on a conception of liberty as non-domination. While this avenue of thought holds considerable promise, such a conception of liberty can only be as sound as the underlying concept of domination, and although the term appears frequently in the pages of contemporary political theory, unlike other basic concepts, domination has received remarkably little in the way of serious conceptual analysis. Indeed, one might be tempted to conclude that (...) is not a substantive concept at all, but rather mere empty rhetoric. This essay represents an experiment of sorts to see if the concept of domination can indeed withstand sustained philosophical examination; to the extent that it is successful, it can be viewed as a friendly addition or amendment to the work of contemporary republican political theorists. (shrink)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  34.  26
    Beyond Domination: An Essay in the Political Philosophy of Education.Patricia White - 1983 - Routledge & Kegan Paul.
    Introduction A book with this title, dealing as it does with the political machinery and political education appropriate to a democratic society, ...
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  35.  6
    Strong Reducibility on Hypersimple Sets.T. G. McLaughlin - 1965 - Notre Dame Journal of Formal Logic 6 (3):229-234.
  36.  35
    Non-Domination and the Ethics of Migration.Sarah Fine - 2014 - Critical Review of International Social and Political Philosophy 17 (1):10-30.
  37.  11
    Truth and Feasible Reducibility.Ali Enayat, Mateusz Łełyk & Bartosz Wcisło - 2020 - Journal of Symbolic Logic 85 (1):367-421.
    Let ${\cal T}$ be any of the three canonical truth theories CT^− (compositional truth without extra induction), FS^− (Friedman–Sheard truth without extra induction), or KF^− (Kripke–Feferman truth without extra induction), where the base theory of ${\cal T}$ is PA. We establish the following theorem, which implies that ${\cal T}$ has no more than polynomial speed-up over PA. Theorem.${\cal T}$is feasibly reducible to PA, in the sense that there is a polynomial time computable function f such that for every ${\cal T}$-proof (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38.  45
    A General Theory of Domination and Justice.Frank Lovett - 2010 - Oxford University Press.
    This study builds on the work of contemporary civic republicans, supplying a detailed analysis of the concept of domination absent in the familiar accounts of political freedom as non-domination.
    Direct download  
     
    Export citation  
     
    Bookmark   42 citations  
  39.  41
    Domination Without Inequality? Mutual Domination, Republicanism, and Gun Control.Andreas T. Schmidt - 2018 - Philosophy and Public Affairs 46 (2):175-206.
  40.  6
    On the Reducibility of Isomorphism Relations.Tapani Hyttinen & Miguel Moreno - 2017 - Mathematical Logic Quarterly 63 (3-4):175-192.
    We study the Borel reducibility of isomorphism relations in the generalized Baire space math formula. In the main result we show for inaccessible κ, that if T is a classifiable theory and math formula is stable with the orthogonal chain property, then the isomorphism of models of T is Borel reducible to the isomorphism of models of math formula.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  4
    Non-Domination and the Libera Res Publica in Cicero's Republicanism.Jed W. Atkins - 2018 - History of European Ideas 44 (6):756-773.
    ABSTRACTThis paper assesses to what extent the neo-Republican accounts of Quentin Skinner and Philip Pettit adequately capture the nature of political liberty at Rome by focusing on Cicero's analysis of the libera res publica. Cicero's analysis in De Republica suggests that the rule of law and a modest menu of individual citizens’ rights guard against citizens being controlled by a master's arbitrary will, thereby ensuring the status of non-domination that constitutes freedom according to the neo-Republican view. He also shows (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  50
    Natural Language, Sortal Reducibility and Generalized Quantifiers.Edward L. Keenan - 1993 - Journal of Symbolic Logic 58 (1):314-325.
    Recent work in natural language semantics leads to some new observations on generalized quantifiers. In § 1 we show that English quantifiers of type $ $ are booleanly generated by their generalized universal and generalized existential members. These two classes also constitute the sortally reducible members of this type. Section 2 presents our main result--the Generalized Prefix Theorem (GPT). This theorem characterizes the conditions under which formulas of the form Q1x 1⋯ Qnx nRx 1⋯ xn and q1x 1⋯ qnx nRx (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  43.  1
    Structural Domination and Structural Freedom: A Feminist Perspective.Jennifer Einspahr - 2010 - Feminist Review 94 (1):1-19.
    After an initial period of feminist theorizing concerned with understanding patriarchy as a structure of male domination, many thinkers turned away from theorizing domination as such and focused instead on women's subjectivity, identity, and agency. While this has fostered important insights into the formation of women's preferences, desires, and choices, this focus on subjectivity and subject formation has largely overshadowed deeper understandings of patriarchy as a structure of male domination while producing elisions between agency and freedom. In (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  44.  44
    Strong Reducibility of Partial Numberings.Dieter Spreen - 2004 - Archive for Mathematical Logic 44 (2):209-217.
    A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numbering to be reduced into corresponding indices of the other numbering. The degrees of partial numberings of a given set with respect to this relation form an upper semilattice.In addition, Ershov’s completion construction for total numberings is extended to the partial case: every partially numbered set can be embedded in a set which results from (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  45.  16
    Bounded Enumeration Reducibility and its Degree Structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
    We study a strong enumeration reducibility, called bounded enumeration reducibility and denoted by ≤be, which is a natural extension of s-reducibility ≤s. We show that ≤s, ≤be, and enumeration reducibility do not coincide on the ${\Pi^0_1}$ –sets, and the structure ${\boldsymbol{\mathcal{D}_{\rm be}}}$ of the be-degrees is not elementarily equivalent to the structure of the s-degrees. We show also that the first order theory of ${\boldsymbol{\mathcal{D}_{\rm be}}}$ is computably isomorphic to true second order arithmetic: this answers an (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  27
    Exploitation, Domination, Competitive Markets, and Unfair Division.Richard Arneson - 2016 - Southern Journal of Philosophy 54 (S1):9-30.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  47.  45
    Compact Domination for Groups Definable in Linear o-Minimal Structures.Pantelis E. Eleftheriou - 2009 - Archive for Mathematical Logic 48 (7):607-623.
    We prove the Compact Domination Conjecture for groups definable in linear o-minimal structures. Namely, we show that every definably compact group G definable in a saturated linear o-minimal expansion of an ordered group is compactly dominated by (G/G 00, m, π), where m is the Haar measure on G/G 00 and π : G → G/G 00 is the canonical group homomorphism.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48. Supervenience and Reducibility: An Odd Couple.Ausonio Marras - 1994 - Philosophical Quarterly 44 (171):215-222.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  49.  10
    A Generalized Borel-Reducibility Counterpart of Shelah’s Main Gap Theorem.Tapani Hyttinen, Vadim Kulikov & Miguel Moreno - 2017 - Archive for Mathematical Logic 56 (3-4):175-185.
    We study the κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}-Borel-reducibility of isomorphism relations of complete first order theories in a countable language and show the consistency of the following: For all such theories T and T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T^{\prime }$$\end{document}, if T is classifiable and T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T^{\prime }$$\end{document} is not, then the isomorphism of models of T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  50.  68
    The Domination Complaint.Philip Pettit - 2005 - Nomos 46:87-117.
1 — 50 / 999