This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

1016 found
Order:
1 — 50 / 1016
  1. Extension, Translation, and the Cantor-Bernstein Property.Thomas William Barrett & Hans Halvorson - manuscript
    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.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  2. A BIBLIOGRAPHY: JOHN CORCORAN's PUBLICATIONS ON ARISTOTLE 1972–2015.John Corcoran - manuscript
    This presentation includes a complete bibliography of John Corcoran’s publications devoted at least in part to Aristotle’s logic. Sections I–IV list 20 articles, 43 abstracts, 3 books, and 10 reviews. It starts with two watershed articles published in 1972: the Philosophy & Phenomenological Research article that antedates Corcoran’s Aristotle’s studies and the Journal of Symbolic Logic article first reporting his original results; it ends with works published in 2015. A few of the items are annotated with endnotes connecting them with (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Computational Reverse Mathematics and Foundational Analysis.Benedict Eastaugh - manuscript
    Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4. Partitions and Objective Indefiniteness.David Ellerman - manuscript
    Classical physics and quantum physics suggest two meta-physical types of reality: the classical notion of a objectively definite reality with properties "all the way down," and the quantum notion of an objectively indefinite type of reality. The problem of interpreting quantum mechanics (QM) is essentially the problem of making sense out of an objectively indefinite reality. These two types of reality can be respectively associated with the two mathematical concepts of subsets and quotient sets (or partitions) which are category-theoretically dual (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5. Conceptual Schemes and the Indefinability of Goodness.Stephen Gutwald - manuscript
    The indefinability of concepts is explored through the idea of a conceptual scheme. Using the Stone duality of Boolean algebras indefinable concepts are categorized as specific types of subspaces. Additionally, indefinability is formulated as a type of algebraic independence and conceptual atomism is investigated from a mathematical perspective.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  6. Contradiction From a Coded Proof Predicate (Very Tentative Draft, Do Not Cite).T. Parent - manuscript
  7. A Cautionary Note About Self-Reference.T. Parent - manuscript
    If a semantically open language has no constraints on self-reference, one can prove an absurdity. The argument utilizes co-referring names 'a0' and 'a1', and the definition of a functional expression 'The reflection of x = y'. The definition enables a type of self-reference without deploying any semantic terminology--yet given that a0= a1, the definition implies the that 'a0' = 'a1', which is absurd. In truth, however, 'the reflection of x = y' expresses an ill-defined function. And since there is a (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  8. Contradiction From the Fixed Point Lemma.T. Parent - manuscript
    This paper argues that the Fixed Point Lemma implies that contradiction is derivable within primitive recursive arithmetic (PRA). Since PRA is consistent, this is regarded as a paradox to be resolved. The argument is inspired by the v-Curry paradox, but we utilize only a syntactic notion of derivability, not a semantic notion such as validity. The new paradox could be blocked by excluding certain formulae from the scope of the Fixed Point Lemma, but this would effectively concede that the unrestricted (...)
    Remove from this list   Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  9. What is Mathematics: Gödel's Theorem and Around (Edition 2015).Karlis Podnieks - manuscript
    Introduction to mathematical logic, part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10. Category Theory: A Gentle Introduction.Peter Smith - manuscript
    This Gentle Introduction is very much still work in progress. Roughly aimed at those who want something a bit more discursive, slower-moving, than Awodey's or Leinster's excellent books. -/- The current [Jan 2018] version is 291pp.
    Remove from this list  
     
    Export citation  
     
    Bookmark   2 citations  
  11. Informal and Formal Proofs, Metalogic, and the Groundedness Problem.Mario Bacelar Valente - manuscript
    When modeling informal proofs like that of Euclid’s Elements using a sound logical system, we go from proofs seen as somewhat unrigorous – even having gaps to be filled – to rigorous proofs. However, metalogic grounds the soundness of our logical system, and proofs in metalogic are not like formal proofs and look suspiciously like the informal proofs. This brings about what I am calling here the groundedness problem: how can we decide with certainty that our metalogical proofs are rigorous (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  12. Shortening Clopen Games.J. P. Aguilera - forthcoming - Journal of Symbolic Logic:1-14.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13. The Order of Reflection.J. P. Aguilera - forthcoming - Journal of Symbolic Logic:1-29.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14. Provably Games.J. P. Aguilera & D. W. Blue - forthcoming - Journal of Symbolic Logic:1-22.
    We isolate two abstract determinacy theorems for games of length $\omega_1$ from work of Neeman and use them to conclude, from large-cardinal assumptions and an iterability hypothesis in the region of measurable Woodin cardinals thatif the Continuum Hypothesis holds, then all games of length $\omega_1$ which are provably $\Delta_1$ -definable from a universally Baire parameter are determined;all games of length $\omega_1$ with payoff constructible relative to the play are determined; andif the Continuum Hypothesis holds, then there is a model of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. Scott Complexity of Countable Structures.Rachel Alvir, Noam Greenberg, Matthew Harrison-Trainor & Dan Turetsky - forthcoming - Journal of Symbolic Logic:1-16.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16. Metrically Homogeneous Graphs of Diameter Three.Daniela Amato, Gregory Cherlin & H. Dugald Macpherson - forthcoming - Journal of Mathematical Logic.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. Dependent Choice, Properness, and Generic Absoluteness.David Asperó & Asaf Karagila - forthcoming - Review of Symbolic Logic:1-25.
    We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to $\mathsf {DC}$ -preserving symmetric submodels of forcing extensions. Hence, $\mathsf {ZF}+\mathsf {DC}$ not only provides the right framework for developing classical analysis, but is also the right base theory over which to safeguard truth in analysis from the independence phenomenon in the presence of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18. How Much Propositional Logic Suffices for Rosser’s Essential Undecidability Theorem?Guillermo Badia, Petr Cintula, Petr Hajek & Andrew Tedder - forthcoming - Review of Symbolic Logic:1-18.
    In this paper we explore the following question: how weak can a logic be for Rosser's essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson's Q is essentially undecidable in intuitionistic logic, and P. Hajek proved it in the fuzzy logic BL for Grzegorczyk's variant of Q which interprets the arithmetic operations as non-total non-functional relations. We present a proof of essential undecidability in a much weaker substructural logic and for a much (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  19. How Much Propositional Logic Suffices for Rosser's Essential Undecidability Theorem?Guillermo Badia, Petr Cintula, Petr Hajek & Andrew Tedder - forthcoming - Review of Symbolic Logic.
    In this paper we explore the following question: how weak can a logic be for Rosser’s essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson’s Q is essentially undecidable in intuitionistic logic, and P. Hájek proved it in the fuzzy logic BL for Grzegorczyk’s variant of Q which interprets the arithmetic operations as nontotal nonfunctional relations. We present a proof of essential undecidability in a much weaker substructural logic and for a much (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  20. Strongly Minimal Steiner Systems I: Existence.John Baldwin & Gianluca Paolini - forthcoming - Journal of Symbolic Logic:1-15.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21. Defining Measures in a Mereological Space.Giuseppina Barbieri & Giangiacomo Gerla - forthcoming - Logic and Logical Philosophy:1.
    We explore the notion of a measure in a mereological structure and we deal with the difficulties arising. We show that measure theory on connection spaces is closely related to measure theory on the class of ortholattices and we present an approach akin to Dempster’s and Shafer’s. Finally, the paper contains some suggestions for further research.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22. Structural Relativity and Informal Rigour.Neil Barton - forthcoming - In Objects, Structures, and Logics, FilMat Studies in the Philosophy of Mathematics.
    Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...)
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  23. On Representations of Intended Structures in Foundational Theories.Neil Barton, Moritz Müller & Mihai Prunescu - forthcoming - Journal of Philosophical Logic:1-14.
    Often philosophers, logicians, and mathematicians employ a notion of intended structure when talking about a branch of mathematics. In addition, we know that there are foundational mathematical theories that can find representatives for the objects of informal mathematics. In this paper, we examine how faithfully foundational theories can represent intended structures, and show that this question is closely linked to the decidability of the theory of the intended structure. We argue that this sheds light on the trade-off between expressive power (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24. Bolzano’s Mathematical Infinite.Anna Bellomo & Guillaume Massas - forthcoming - Review of Symbolic Logic:1-80.
    Bernard Bolzano (1781-1848) is commonly thought to have attempted to develop a theory of size for infinite collections that follows the so-called part-whole principle, according to which the whole is always greater than any of its proper parts. In this paper, we develop a novel interpretation of Bolzano's mature theory of the infinite and show that, contrary to mainstream interpretations, it is best understood as a theory of infinite sums. Our formal results show that Bolzano's infinite sums can be equipped (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25. Characterizing Existence of a Measurable Cardinal Via Modal Logic.G. Bezhanishvili, N. Bezhanishvili, J. Lucero-Bryan & J. van Mill - forthcoming - Journal of Symbolic Logic:1-15.
    We prove that the existence of a measurable cardinal is equivalent to the existence of a normal space whose modal logic coincides with the modal logic of the Kripke frame isomorphic to the powerset of a two element set.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26. The Additive Groups of ℤ and ℚ with Predicates for Being Square‐Free.Neer Bhardwaj & Minh Chieu Tran - forthcoming - Journal of Symbolic Logic:1-26.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27. Extension and Self-Connection.Ben Blumson & Manikaran Singh - forthcoming - Logic and Logical Philosophy.
    If two self-connected individuals are connected, it follows in classical extensional mereotopology that the sum of those individuals is self-connected too. Since mainland Europe and mainland Asia, for example, are both self-connected and connected to each other, mainland Eurasia is also self-connected. In contrast, in non-extensional mereotopologies, two individuals may have more than one sum, in which case it does not follow from their being self-connected and connected that the sum of those individuals is self-connected too. Nevertheless, one would still (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  28. Frege’s Theory of Real Numbers: A Consistent Rendering.Francesca Boccuni & Marco Panza - forthcoming - Review of Symbolic Logic:1-44.
    Frege's definition of the real numbers, as envisaged in the second volume of Grundgesetze der Arithmetik, is fatally flawed by the inconsistency of Frege's ill-fated Basic Law V. We restate Frege's definition in a consistent logical framework and investigate whether it can provide a logical foundation of real analysis. Our conclusion will deem it doubtful that such a foundation along the lines of Frege's own indications is possible at all.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29. Combinatorics of Ultrafilters on Cohen and Random Algebras.Jörg Brendle & Francesco Parente - forthcoming - Journal of Symbolic Logic:1-16.
    We investigate the structure of ultrafilters on Boolean algebras in the framework of Tukey reducibility. In particular, this paper provides several techniques to construct ultrafilters which are not Tukey maximal. Furthermore, we connect this analysis with a cardinal invariant of Boolean algebras, the ultrafilter number, and prove consistency results concerning its possible values on Cohen and random algebras.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30. Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - forthcoming - Review of Symbolic Logic.
    One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  31. On the (In)Dependence of the Peano Axioms for Natural Numbers.Márcia R. Cerioli, Hugo Nobrega, Guilherme Silveira & Petrucio Viana - forthcoming - History and Philosophy of Logic:1-19.
    We investigate two notions of independence— independence and complete independence—applied to the Peano axioms for the sequence of natural numbers. We review the results that, although they...
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32. Model Theory and Combinatorics of Banned Sequences.Hunter Chase & James Freitag - forthcoming - Journal of Symbolic Logic:1-19.
    We set up a general context in which one can prove Sauer-Shelah type lemmas. We apply our general results to answer a question of Bhaskar [1] and give a slight improvement to a result of Malliaris and Terry [7]. We also prove a new Sauer-Shelah type lemma in the context of op-rank, a notion of Guingona and Hill [4].
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33. The Well-Ordered Society Under Crisis: A Formal Analysis of Public Reason Vs. Convergence Discourse.Hun Chung - forthcoming - American Journal of Political Science:1-20.
    A well-ordered society faces a crisis whenever a sufficient number of noncompliers enter into the political system. This has the potential to destabilize liberal democratic political order. This article provides a formal analysis of two competing solutions to the problem of political stability offered in the public reason liberalism literature—namely, using public reason or using convergence discourse to restore liberal democratic political order in the well-ordered society. The formal analyses offered in this article show that using public reason fails completely, (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  34. Ramsey’s Coheir.Eugenio Colla & Domenico Zambella - forthcoming - Journal of Symbolic Logic:1-13.
    We use the model theoretic notion of coheir to give short proofs of old and new theorems in Ramsey Theory. As an illustration we start from Ramsey's theorem itself. Then we prove Hindman's theorem and the Hales-Jewett theorem. Finally, we prove the two Ramsey theoretic principles that have among their consequences partition theorems due to Carlson and to Gowers.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35. Weakly Free Multialgebras.Marcelo E. Coniglio & Guilherme V. Toledo - forthcoming - Bulletin of the Section of Logic.
    In abstract algebraic logic, many systems, such as those paraconsistent logics taking inspiration from da Costa's hierarchy, are not algebraizable by even the broadest standard methodologies, as that of Blok and Pigozzi. However, these logics can be semantically characterized by means of non-deterministic algebraic structures such as Nmatrices, RNmatrices and swap structures. These structures are based on multialgebras, which generalize algebras by allowing the result of an operation to assume a non-empty set of values. This leads to an interest in (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36. A Class of Fields with a Restricted Model Completeness Property.Philip Dittmann & Dion Leijnse - forthcoming - Journal of Symbolic Logic:1-9.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37. The Relativized Lascar Groups, Type-Amalgamations, and Algebraicity.Jan Dobrowolski, Byunghan Kim, Alexei Kolesnikov & Junguk Lee - forthcoming - Journal of Symbolic Logic:1-34.
    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 certain model theoretic property that (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  38. Relationships Between Computability‐Theoretic Properties of Problems.Rod Downey, Noam Greenberg, Matthew Harrison‐Trainor, Ludovic Patey & Dan Turetsky - forthcoming - Journal of Symbolic Logic:1-26.
  39. Recursive Axiomatisations From Separation Properties.Rob Egrot - forthcoming - Journal of Symbolic Logic:1-30.
    We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property, We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation subclasses whose axiomatisations are recursively enumerable in our second-order fragment can also be recursively axiomatised in their original first-order language. We pin down the expressive power of this formalism with respect to first-order logic, and investigate some questions relating to decidability and computational complexity. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Generic Coding with Help and Amalgamation Failure.Sy‐David Friedman & Dan Hathaway - forthcoming - Journal of Symbolic Logic:1-13.
  41. A Generalization of Monadic n-Valued Łukasiewicz Algebras.Carlos Gallardo & Alicia Ziliani - forthcoming - Studia Logica:1-22.
    \ of monadic m-generalized Łukasiewicz algebras of order n -algebras), namely a generalization of monadic n-valued Łukasiewicz algebras. In this article, we determine the congruences and we characterized the subdirectly irreducible \-algebras. From this last result we proved that \ is a discriminator variety and as a consequence we characterized the principal congruences. In the last part of this paper we find an immersion of these algebras in a functional algebra and we proved that in the finite case they are (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  42. A Structural Dichotomy in the Enumeration Degrees.Hristo A. Ganchev, Iskander Sh Kalimullin, Joseph S. Miller & Mariya I. Soskova - forthcoming - Journal of Symbolic Logic:1-18.
    We give several new characterizations of the continuous enumeration degrees. The main one proves that an enumeration degree is continuous if and only if it is not half a nontrivial relativized K-pair. This leads to a structural dichotomy in the enumeration degrees.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43. On a Problem of Friedman and its Solution by Rybakov.Jeroen P. Goudsmit - forthcoming - Bulletin of Symbolic Logic:1-48.
    Rybakov (1984a) proved that the admissible rules of IPC are decidable. We give a proof of the same theorem, using the same core idea, but couched in the many notions that have been developed in the mean time. In particular, we illustrate how the argument can be interpreted as using refinements of the notions of exactness and extendibility.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44. On the Invariance of Gödel’s Second Theorem with Regard to Numberings.Balthasar Grabmayr - forthcoming - Review of Symbolic Logic:1-34.
    The prevalent interpretation of Gödel’s Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of the underlying mathematical theorem depends on several arbitrary formalisation choices. In this paper I examine the theorem’s dependency regarding Gödel numberings. I introduce deviant numberings, yielding provability predicates satisfying Löb’s conditions, which result in provable consistency sentences. According to the main result of this paper (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  45. Maximal Almost Disjoint Families, Determinacy, and Forcing.Karen Bakke Haga, David Schrittesser & Asger Törnquist - forthcoming - Journal of Mathematical Logic.
    We study the notion of ????-MAD families where ???? is a Borel ideal on ω. We show that if ???? is any finite or countably iterated Fubini product of the ideal of finite sets Fin, then there are no analytic...
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46. The Σ1-Definable Universal Finite Sequence.Joel David Hamkins & Kameryn J. Williams - forthcoming - Journal of Symbolic Logic:1-19.
  47. Free Definite Description Theory – Sequent Calculi and Cut Elimination.Andrzej Indrzejczak - forthcoming - Logic and Logical Philosophy:1.
    We provide an application of a sequent calculus framework to the formalization of definite descriptions. It is a continuation of research undertaken in [20, 22]. In the present paper a so-called free description theory is examined in the context of different kinds of free logic, including systems applied in computer science and constructive mathematics for dealing with partial functions. It is shown that the same theory in different logics may be formalised by means of different rules and gives results of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48. Forking and Dividing in Fields with Several Orderings and Valuations.Will Johnson - forthcoming - Journal of Mathematical Logic:2150025.
    We consider existentially closed fields with several orderings, valuations, and [Formula: see text]-valuations. We show that these structures are NTP2 of finite burden, but usually have the independence property. Moreover, forking agrees with dividing, and forking can be characterized in terms of forking in ACVF, RCF, and [Formula: see text]CF.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49. Forking and Dividing in Fields with Several Orderings and Valuations.Will Johnson - forthcoming - Journal of Mathematical Logic.
    We consider existentially closed fields with several orderings, valuations, and p-valuations. We show that these structures are NTP2 of finite burden, but usually have the independence property. Mo...
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. On the Automorphism Group of the Universal Homogeneous Meet-Tree.Itay Kaplan, Tomasz Rzepecki & Daoud Siniora - forthcoming - Journal of Symbolic Logic:1-33.
    We show that the countable universal homogeneous meet-tree has a generic automorphism, but does not have a generic pair of automorphisms.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1016