- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Add citations
You must login to add citations.
|
|
|
The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently. |
|
|
|
|
|
We observe simple links between equivalence relations, groups, fields and groupoids (and between preorders, semi-groups, rings and categories), which are type-definable in an arbitrary structure, and apply these observations to the particular context of small and simple structures. Recall that a structure is small if it has countably many n-types with no parameters for each natural number n. We show that a θ-type-definable group in a small structure is the conjunction of definable groups, and extend the result to semi-groups, fields, (...) |
|
|
We show that the N₀-categorical structures produced by Hrushovski's predimension construction with a control function fit neatly into Shelah's $SOP_n $ hierarchy: if they are not simple, then they have SOP₃ and NSOP₄. We also show that structures produced without using a control function can be undecidable and have SOP. |
|
|
We study the groups Gal L and Gal KP, and the associated equivalence relations EL and EKP, attached to a first order theory T. An example is given where EL≠ EKP. It is proved that EKP is the composition of EL and the closure of EL. Other examples are given showing this is best possible. |
|
|
Under [Formula: see text]-amalgamation, we obtain the canonical hyperdefinable group from the group configuration. |
|
|
We construct a stable one-based, trivial theory with a reduct which is not trivial. This answers a question of John B. Goode. Using this, we construct a stable theory which is n-ample for all natural numbers n, and does not interpret an infinite group. |
|
|
|
|
|
Let G be a definably compact group in an o-minimal expansion of a real closed field. We prove that if dim(G\X) < dim G for some definable ${X \subseteq G}$ then X contains a torsion point of G. Along the way we develop a general theory for the so-called G-linear sets, and investigate definable sets which contain abstract subgroups of G. |
|
|
We show that under Martin's Axiom, the cofinality cf(Aut(Γ)) of the automorphism group of the random graph Γ is 2 ω. |
|
|
We point out that a certain complex compact manifold constructed by Lieberman has the dimensional order property, and has U-rank different from Morley rank. We also give a sufficient condition for a Kahler manifold to be totally degenerate (that is, to be an indiscernible set, in its canonical language) and point out that there are K3 surfaces which satisfy these conditions. |
|
|
We initiate a geometric stability study of groups of the form G/G00, where G is a 1-dimensional definably compact, definably connected, definable group in a real closed field M. We consider an enriched structure M′ with a predicate for G00 and check 1-basedness or non-1-basedness for G/G00, where G is an additive truncation of M, a multiplicative truncation of M, SO2(M) or one of its truncations; such groups G/G00 are now interpretable in M′. We prove that the only 1-based groups (...) |
|
|
A lattice L is coordinatizable, if it is isomorphic to the lattice L of principal right ideals of some von Neumann regular ring R. This forces L to be complemented modular. All known sufficient conditions for coordinatizability, due first to von Neumann, then to Jónsson, are first-order. Nevertheless, we prove that coordinatizability of lattices is not first-order, by finding a non-coordinatizable lattice K with a coordinatizable countable elementary extension L. This solves a 1960 problem of Jónsson. We also prove that (...) |
|
|
|
|
|
|
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-c4c498947-z4tjs uwo