scientific article; zbMATH DE number 3027246
From MaRDI portal
Publication:5767299
Cited in
(40)- The combinatorial principle ⋄#
- The classical and the ω-complete arithmetic
- On Scott and Karp trees of uncountable models
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
- 2007-2008 Winter Meeting of the Association for Symbolic Logic
- Set theory with a filter quantifier
- On the complexity of models of arithmetic
- European Summer Meeting of the Association for Symbolic Logic
- Some remarks on initial segments in models of Peano arithmetic
- Universal recursion theoretic properties of r.e. preordered structures
- Alfred Tarski's work in model theory
- Why Solovay real produces Cohen real
- On topological spaces equivalent to ordinals
- Models with the ω-property
- Almost disjoint sets and Martin's axiom
- Stability theory and Algebra
- Chains and antichains in
- On P-points over a measurable cardinal
- Calculating self-referential statements: Guaspari sentences of the first kind
- The metamathematics of model theory: Discovering language in action
- The equivalence of a generalized Martin's axiom to a combinatorial principle
- An inside view of EXP; or, The closed fragment of the provability logic of IΔ0 + Ω1 with a prepositional constant for EXP
- A Spector-Gandy theorem for cPCd() classes
- One hundred and two problems in mathematical logic
- Some results on measure independent Gödel speed-ups
- 1997–98 Annual Meeting of the Association for Symbolic Logic
- IX Latin American Symposium on Mathematical Logic, Bahía Blanca, 1992
- The dense linear ordering principle
- An Elementary Approach to the Fine Structure of L
- Partitioning large vector spaces
- Borel's conjecture in topological groups
- Combinatorial properties of filters and open covers for sets of real numbers
- Geometry of *-Finite Types
- Two consistency results on set mappings
- Leibnizian models of set theory
- Game-theoretic versions of strong law of large numbers for unbounded variables
- Turing computable embeddings
- Products of two-sorted structures
- Trees
- Generalized quantification as substructural logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5767299)