James H. Schmerl

From MaRDI portal
Person:190265

Available identifiers

zbMath Open schmerl.james-hMaRDI QIDQ190265

List of research outcomes

PublicationDate of PublicationType
CP‐generic expansions of models of Peano Arithmetic2023-09-12Paper
The diversity of minimal cofinal extensions2022-12-19Paper
Fixed Sets of Automorphisms of Countable, Arithmetically Saturated Structures2022-04-07Paper
The Diversity of Minimal Cofinal Extensions2021-09-16Paper
The Barwise-Schlipf theorem2021-01-26Paper
A remark on a theorem of Erdős2020-08-11Paper
Lofty Models of Peano Arithmetic2020-02-16Paper
https://portal.mardi4nfdi.de/entity/Q52135542020-02-03Paper
The Pentagon as a Substructure Lattice of Models of Peano Arithmetic2019-10-11Paper
Kernels, truth and satisfaction2019-06-18Paper
ACCEPTABLE COLORINGS OF INDEXED HYPERSPACES2019-01-04Paper
More automorphism groups of countable, arithmetically saturated models of Peano arithmetic2018-12-21Paper
Chromatic numbers of algebraic hypergraphs2018-10-25Paper
DECIDING THE CHROMATIC NUMBERS OF ALGEBRAIC HYPERGRAPHS2018-05-02Paper
Minimal elementary end extensions2017-09-15Paper
Cofinal Extensions and Coded Sets2017-08-02Paper
AUTOMORPHISM GROUPS OF COUNTABLE ARITHMETICALLY SATURATED MODELS OF PEANO ARITHMETIC2016-03-22Paper
Semialgebraic graphs having countable list-chromatic numbers2016-03-03Paper
UNCOUNTABLE REAL CLOSED FIELDS WITH PA INTEGER PARTS2015-08-14Paper
AUTOMORPHISM GROUPS OF SATURATED MODELS OF PEANO ARITHMETIC2014-09-30Paper
Subsets coded in elementary end extensions2014-08-29Paper
Cofinal elementary extensions2014-03-21Paper
A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids2013-01-07Paper
On cofinal submodels and elementary interstices2012-11-23Paper
The automorphism group of a resplendent model2012-09-18Paper
Elementary cuts in saturated models of Peano arithmetic2012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q31183962012-03-02Paper
https://portal.mardi4nfdi.de/entity/Q31184012012-03-02Paper
https://portal.mardi4nfdi.de/entity/Q31150482012-02-20Paper
GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES2012-02-10Paper
Dividing a polygon into two similar polygons2011-02-18Paper
Infinite substructure lattices of models of Peano Arithmetic2011-01-12Paper
Reverse Mathematics and Grundy colorings of graphs2010-11-04Paper
Covering the plane with sprays2010-06-01Paper
Some 2-point sets2010-04-22Paper
An improvement to ``A note on Euclidean Ramsey theory2010-03-04Paper
Self-embeddings of computable trees2010-01-13Paper
Nondiversity in substructures2008-05-08Paper
A note on Euclidean Ramsey theory2007-10-11Paper
https://portal.mardi4nfdi.de/entity/Q54849452006-08-23Paper
https://portal.mardi4nfdi.de/entity/Q57118942005-12-08Paper
https://portal.mardi4nfdi.de/entity/Q57118952005-12-08Paper
Generic automorphisms and graph coloring2005-04-18Paper
https://portal.mardi4nfdi.de/entity/Q46568062005-03-14Paper
Substructure lattices and almost minimal end extensions of models of Peano arithmetic2005-02-16Paper
Partitioning large vector spaces2005-02-09Paper
Automorphism groups of models of Peano arithmetic2004-03-01Paper
Some highly saturated models of Peano arithmetic2004-03-01Paper
Minimal spanning trees2003-10-29Paper
How many clouds cover the plane?2003-09-10Paper
https://portal.mardi4nfdi.de/entity/Q45310912002-11-11Paper
https://portal.mardi4nfdi.de/entity/Q27655712002-11-11Paper
Obstacles to extending Mirsky's theorem2002-09-18Paper
The two points theorem of Mazurkiewicz2002-09-12Paper
Coloring ${\mathbb R}^n$2001-12-10Paper
Recursive models and the divisibility poset2001-07-17Paper
Elementary extensions of models of set theory2001-07-12Paper
https://portal.mardi4nfdi.de/entity/Q45211282001-02-25Paper
https://portal.mardi4nfdi.de/entity/Q44948982000-08-09Paper
Avoidable algebraic subsets of Euclidean space2000-05-22Paper
https://portal.mardi4nfdi.de/entity/Q47005191999-12-19Paper
What's the difference1999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42225941999-08-31Paper
https://portal.mardi4nfdi.de/entity/Q42185311999-07-07Paper
Difference Sets and Recursion Theory1999-05-24Paper
The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic1999-02-02Paper
Countable partitions of Euclidean space1998-05-14Paper
\(\text{PA} (aa)\)1996-10-27Paper
A reflection principle and its applications to nonstandard models1996-09-30Paper
Arithmetically saturated models of arithmetic1996-05-22Paper
https://portal.mardi4nfdi.de/entity/Q48732211996-04-16Paper
The isomorphism property for nonstandard universes1996-03-17Paper
Triangle-Free Partitions of Euclidean Space1995-12-11Paper
Fractional products of sets1995-09-22Paper
Tiling space with notched cubes1995-03-15Paper
The regularity of some 1-additive sequences1995-01-03Paper
On maximal subgroups of the automorphism group of a countable recursively saturated model of PA1994-09-26Paper
A weakly definable type which is not definable1994-09-19Paper
The order dimension of relatively free lattices1994-05-15Paper
Combinatorial Dimension of Fractional Cartesian Products1994-03-10Paper
Partitioning Euclidean space1993-09-02Paper
Finite Substructure Lattices of Models of Peano Arithmetic1993-06-29Paper
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures1993-06-29Paper
End extensions of models of arithmetic1993-02-22Paper
A general framework for discovering and proving theorems of the Erdős- Ko-Rado type1993-01-17Paper
Minimal satisfaction classes with an application to rigid models of Peano arithmetic1992-06-28Paper
Prime ideals in incidence algebras1992-06-28Paper
Binary relational structures having only countably many nonisomorphic substructures1992-06-27Paper
Making the hyperreal line both saturated and complete1992-06-27Paper
Coinductive ℵ0-categorical theories1990-01-01Paper
Isomorphic incidence algebras1990-01-01Paper
A combinatorial result about points and balls in Euclidean space1989-01-01Paper
A note on the multiplicative semigroup of models of Peano arithmetic1989-01-01Paper
Partially ordered sets and the independence property1989-01-01Paper
Large resplendent models generated by indiscernibles1989-01-01Paper
Remarks on weak notions of saturation in models of Peano arithmetic1987-01-01Paper
Ordered sets with small width and large jump number1986-01-01Paper
The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)1986-01-01Paper
Jump number and width1986-01-01Paper
Peano Arithmetic and Hyper-Ramsey Logic1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37243171986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37279971986-01-01Paper
Theories Having Finitely Many Countable Homogeneous Models1986-01-01Paper
Models of Peano arithmetic and a question of Sikorski on ordered fields1985-01-01Paper
Recursively saturated models generated by indiscernibles1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36792131985-01-01Paper
Saturation and simple extensions of models of Peano arithmetic1984-01-01Paper
On the size of jump-critical ordered sets1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33441831984-01-01Paper
Some applications of Vizing's theorem to vertex colorings of graphs1983-01-01Paper
ℵ 0 -Categorical Distributive Lattices of Finite Breadth1983-01-01Paper
The Effective Version of Brooks' Theorem1982-01-01Paper
On the role of Ramsey quantifiers in first order arithmetic1982-01-01Paper
Correction to Peano models with many generic classes1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39226841981-01-01Paper
Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39313681981-01-01Paper
Arborescent Structures. II: Interpretability in the Theory of Trees1981-01-01Paper
Decidability and ℵ0-categoricity of theories of partially ordered sets1980-01-01Paper
Recursive Colorings of Graphs1980-01-01Paper
Countable homogeneous partially ordered sets1979-01-01Paper
Theories with recursive models1979-01-01Paper
On \(\aleph_0\)-categoricity of filtered Boolean extensions1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38824371978-01-01Paper
A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function1978-01-01Paper
Extending models of arithmetic1978-01-01Paper
Theories with only a finite number of existentially complete models1977-01-01Paper
On $ℵ_0$-categoricity and the theory of trees1977-01-01Paper
ℵ 0 -Categoricity of Partially Ordered Sets of Width 21977-01-01Paper
An axiomatization for a class of two-cardinal models1977-01-01Paper
Remarks on Self‐Extending Models1976-01-01Paper
Effectiveness and Vaught's Gap ω Two-Cardinal Theorem1976-01-01Paper
On κ-like structures which embed stationary and closed unbounded subsets1976-01-01Paper
The decidability of some $ℵ_0$-categorical theories1976-01-01Paper
Generalizing special Aronszajn trees1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40812381975-01-01Paper
The Undecidability of Theories of Groupoids with an Extra Predicate1974-01-01Paper
The Undecidability of Theories of Groupoids with an Extra Predicate1974-01-01Paper
A Partition Property Characterizing Cardinals Hyperinaccessible of Finite Type1974-01-01Paper
Peano models with many generic classes1973-01-01Paper
An elementary sentence which has ordered models1972-01-01Paper
On power-like models for hyperinaccessible cardinals1972-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: James H. Schmerl