Saharon Shelah

According to our database1, Saharon Shelah authored at least 386 papers between 1970 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Set Mappings on 4-Tuples.
Notre Dame Journal of Formal Logic, 2018

On the Spectrum of Characters of Ultrafilters.
Notre Dame Journal of Formal Logic, 2018

Clubs on quasi measurable cardinals.
Math. Log. Q., 2018

On Cuts in Ultraproducts of linear Orders II.
J. Symb. Log., 2018

Abstract elementary classes stable in ℵ0.
Ann. Pure Appl. Logic, 2018

On the class of flat stable theories.
Ann. Pure Appl. Logic, 2018

A model of $$\mathsf {ZFA}+ \mathsf {PAC}$$ ZFA + PAC with no outer model of $$\mathsf {ZFAC}$$ ZFAC with the same pure part.
Arch. Math. Log., 2018

2017
Universal Structures.
Notre Dame Journal of Formal Logic, 2017

Coding with canonical functions.
Math. Log. Q., 2017

Decidability and Classification of the Theory of Integers with Primes.
J. Symb. Log., 2017

No Uncountable Polish Group Can be a Right-Angled Artin Group.
Axioms, 2017

A parallel to the null ideal for inaccessible λ: Part I.
Arch. Math. Log., 2017

The nonstationary ideal on $$P_\kappa (\lambda )$$ P κ ( λ ) for $$\lambda $$ λ singular.
Arch. Math. Log., 2017

Creature forcing and five cardinal characteristics in Cichoń's diagram.
Arch. Math. Log., 2017

2016
There are no very meager sets in the model in which both the Borel Conjecture and the dual Borel Conjecture are true.
Math. Log. Q., 2016

Stable theories and representation over sets.
Math. Log. Q., 2016

Forcing a countable structure to belong to the ground model.
Math. Log. Q., 2016

Constructing Many Atomic Models in ℵ1.
J. Symb. Log., 2016

Universal graphs with a forbidden subgraph: Block path solidity.
Combinatorica, 2016

ZF + DC + AX4.
Arch. Math. Log., 2016

Cofinality of normal ideals on [λ] I.
Arch. Math. Log., 2016

2015
Regular Ultrapowers at Regular Cardinals.
Notre Dame Journal of Formal Logic, 2015

Models of PA: when two elements are necessarily order automorphic.
Math. Log. Q., 2015

Positional Strategies in Long Ehrenfeucht-FraïSSé Games.
J. Symb. Log., 2015

Mad spectra.
J. Symb. Log., 2015

Almost Galois ω-Stable Classes.
J. Symb. Log., 2015

On Failure of 0-1 Laws.
Proceedings of the Fields of Logic and Computation II, 2015

An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers.
Proceedings of the Fields of Logic and Computation II, 2015

A.E.C. with Not Too Many Models.
Proceedings of the Logic Without Borders, 2015

Saturating the Random Graph with an Independent Family of Small Range.
Proceedings of the Logic Without Borders, 2015

2014
Monotone hulls for \({\mathcal {N}}\cap {\mathcal {M}}\).
Periodica Mathematica Hungarica, 2014

A Hanf number for saturation and omission: the superstable case.
Math. Log. Q., 2014

Model-Theoretic Properties of Ultrafilters Built by Independent families of Functions.
J. Symb. Log., 2014

Examples in dependent Theories.
J. Symb. Log., 2014

Many countable support iterations of proper forcings preserve Souslin trees.
Ann. Pure Appl. Logic, 2014

Models of Cohen measurability.
Ann. Pure Appl. Logic, 2014

2013
Large weight does not yield an irreducible base.
Periodica Mathematica Hungarica, 2013

A Closed Algebra with a Non-Borel Clone and an Ideal with a Borel Clone.
IJAC, 2013

Chain conditions in dependent groups.
Ann. Pure Appl. Logic, 2013

Non-forking frames in abstract elementary classes.
Ann. Pure Appl. Logic, 2013

Applications of pcf for mild large cardinals to elementary embeddings.
Ann. Pure Appl. Logic, 2013

More about λ-support iterations of (<λ)-complete forcing notions.
Arch. Math. Log., 2013

A Finite Partition Theorem with Double Exponential Bound.
Proceedings of the Mathematics of Paul Erdős II, 2013

2012
Adding linear orders.
J. Symb. Log., 2012

A strong polarized relation.
J. Symb. Log., 2012

Majority decisions when abstention is possible.
Discrete Mathematics, 2012

Universality among graphs omitting a complete bipartite graph.
Combinatorica, 2012

External automorphisms of ultraproducts of finite models.
Arch. Math. Log., 2012

Creature forcing and large continuum: the joy of halving.
Arch. Math. Log., 2012

2011
Reasonable Ultrafilters, Again.
Notre Dame Journal of Formal Logic, 2011

Depth of Boolean Algebras.
Notre Dame Journal of Formal Logic, 2011

Models of expansions of &equation image; with no end extensions.
Math. Log. Q., 2011

The minimal cofinality of an ultrapower of ω and the cofinality of the symmetric groupcan be larger than +.
J. Symb. Log., 2011

Saccharinity.
J. Symb. Log., 2011

Ramsey theorems for product of finite sets with submeasures.
Combinatorica, 2011

More on the pressing down game.
Arch. Math. Log., 2011

2010
On long increasing chains modulo flat ideals.
Math. Log. Q., 2010

A Sacks real out of nowhere.
J. Symb. Log., 2010

Dual Borel Conjecture and Cohen reals.
J. Symb. Log., 2010

Filtration-equivalent aleph1-separable abelian groups of cardinality aleph1.
Ann. Pure Appl. Logic, 2010

Hereditary Zero-One Laws for Graphs.
Proceedings of the Fields of Logic and Computation, 2010

2009
Splitting stationary sets from weak forms of Choice.
Math. Log. Q., 2009

Model theory without choice? Categoricity.
J. Symb. Log., 2009

Decisive creatures and large continuum.
J. Symb. Log., 2009

Successors of singular cardinals and coloring theorems {II}.
J. Symb. Log., 2009

The amalgamation spectrum.
J. Symb. Log., 2009

What majority decisions are possible.
Discrete Mathematics, 2009

The Odd-Distance Plane Graph.
Discrete & Computational Geometry, 2009

The automorphism tower of a centerless group without Choice.
Arch. Math. Log., 2009

2008
Groupwise density cannot be much bigger than the unbounded number.
Math. Log. Q., 2008

Generating ultrafilters in a reasonable way.
Math. Log. Q., 2008

The stationary set splitting game.
Math. Log. Q., 2008

Regular ultrafilters and finite square principles.
J. Symb. Log., 2008

The number of openly generated Boolean algebras.
J. Symb. Log., 2008

Examples of non-locality.
J. Symb. Log., 2008

More on SOP1 and SOP2.
Ann. Pure Appl. Logic, 2008

2007
Existence of EF-equivalent non-isomorphic models.
Math. Log. Q., 2007

Two cardinal models for singular µ.
Math. Log. Q., 2007

Power set modulo small, the singular of uncountable cofinality.
J. Symb. Log., 2007

Winning the pressing down game but not Banach-Mazur.
J. Symb. Log., 2007

Relational structures constructible by quantifier free definable operations.
J. Symb. Log., 2007

Universal graphs with a forbidden subtree.
J. Comb. Theory, Ser. B, 2007

Increasing the groupwise density number by c.c.c. forcing.
Ann. Pure Appl. Logic, 2007

Universal forcing notions and ideals.
Arch. Math. Log., 2007

2006
Recursive logic frames.
Math. Log. Q., 2006

How much sweetness is there in the universe?
Math. Log. Q., 2006

On weak and strong interpolation in algebraic logics.
J. Symb. Log., 2006

More on the revised GCH and the black box.
Ann. Pure Appl. Logic, 2006

Covering the Baire space by families which are not finitely dominating.
Ann. Pure Appl. Logic, 2006

Models of real-valued measurability.
Ann. Pure Appl. Logic, 2006

On properties of theories which preclude the existence of universal models.
Ann. Pure Appl. Logic, 2006

The f-factor Problem for Graphs and the Hereditary Property.
Arch. Math. Log., 2006

2005
Two cardinals models with gap one revisited.
Math. Log. Q., 2005

On topological properties of ultraproducts of finite sets.
Math. Log. Q., 2005

Preserving preservation.
J. Symb. Log., 2005

A dichotomy in classifying quantifiers for finite models.
J. Symb. Log., 2005

Subsets of superstable structures are weakly benign.
J. Symb. Log., 2005

Finite subgraphs of uncountably chromatic graphs.
Journal of Graph Theory, 2005

k-bounded exponential-logarithmic power series fields.
Ann. Pure Appl. Logic, 2005

A note on extensions of infinitary logic.
Arch. Math. Log., 2005

Middle diamond.
Arch. Math. Log., 2005

Successors of singular cardinals and coloring theorems I.
Arch. Math. Log., 2005

2004
More on regular reduced products.
J. Symb. Log., 2004

A definable nonstandard model of the reals.
J. Symb. Log., 2004

Ladder gaps over stationary sets.
J. Symb. Log., 2004

Axiom of choice and chromatic number: examples on the plane.
J. Comb. Theory, Ser. A, 2004

On lhd*-maximality.
Ann. Pure Appl. Logic, 2004

Forcing axiom failure for any lambda > aleph1.
Arch. Math. Log., 2004

On nice equivalence relations on ?2.
Arch. Math. Log., 2004

Sweet & sour and other flavours of ccc forcing notions.
Arch. Math. Log., 2004

On the existence of universal models.
Arch. Math. Log., 2004

2003
Universal graphs at the successor of a singular cardinal.
J. Symb. Log., 2003

Additivity properties of topological diagonalizations.
J. Symb. Log., 2003

Axiom of choice and chromatic number of the plane.
J. Comb. Theory, Ser. A, 2003

On the order of countable graphs.
Eur. J. Comb., 2003

A Partition Theorem for Scattered Order Types.
Combinatorics, Probability & Computing, 2003

Karp complexity and classes with the independence property.
Ann. Pure Appl. Logic, 2003

Analytic colorings.
Ann. Pure Appl. Logic, 2003

More Jonsson Algebras.
Arch. Math. Log., 2003

On ultraproducts of Boolean algebras and irr.
Arch. Math. Log., 2003

Specialising Aronszajn trees by countable approximations.
Arch. Math. Log., 2003

Evasion and prediction.
Arch. Math. Log., 2003

Strongly meager sets of size continuum.
Arch. Math. Log., 2003

Spectra of Monadic Second-Order Formulas with One Unary Function.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

2002
Antichains in Products of Linear Orders.
Order, 2002

Definability of Initial Segments.
Notre Dame Journal of Formal Logic, 2002

The Relative Consistency of g < cf (Sym(omega)).
J. Symb. Log., 2002

The Strict Order Property and Generic Automorphisms.
J. Symb. Log., 2002

On Regular Reduced Products.
J. Symb. Log., 2002

On Polynomial Time Computation over Unordered Structures.
J. Symb. Log., 2002

Coding with Ladders A Well Ordering of The Reals.
J. Symb. Log., 2002

Almost free groups and Ehrenfeucht-Fraïssé games for successors of singular cardinals.
Ann. Pure Appl. Logic, 2002

More constructions for Boolean algebras.
Arch. Math. Log., 2002

PCF and infinite free subsets in an algebra.
Arch. Math. Log., 2002

On the existence of large subsets of [lambda]kappa which contain no unbounded non-stationary subsets.
Arch. Math. Log., 2002

Strongly meager and strong measure zero sets.
Arch. Math. Log., 2002

2001
Model Companions of TAut for Stable T.
Notre Dame Journal of Formal Logic, 2001

Forcing Many Positive Polarized Partition Relations Between A Cardinal and Its Powerset.
J. Symb. Log., 2001

The Covering Numbers of Mycielski Ideals Are All Equal.
J. Symb. Log., 2001

Main Gap for Locally Saturated Elementary Submodels of A Homogeneous Structure.
J. Symb. Log., 2001

Regular Subalgebras of Complete Boolean Algebras.
J. Symb. Log., 2001

Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property.
Combinatorica, 2001

Relations between some cardinals in the absence of the Axiom of Choice.
Bulletin of Symbolic Logic, 2001

Fallen cardinals.
Ann. Pure Appl. Logic, 2001

On the weak Freese-Nation property of complete Boolean algebras.
Ann. Pure Appl. Logic, 2001

Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187.
Ann. Pure Appl. Logic, 2001

The Karp complexity of unstable classes.
Arch. Math. Log., 2001

On some configurations related to the Shelah Weak Hypothesis.
Arch. Math. Log., 2001

2000
On the Classifiability of Cellular Automata.
Theor. Comput. Sci., 2000

A Space with Only Borel Subsets.
Periodica Mathematica Hungarica, 2000

Stationary Sets and Infinitary Logic.
J. Symb. Log., 2000

On Inverse gamma-Systems and The Number of Linfinite lambda-Equivalent, Non-Isomorphic Models for lambda Singular.
J. Symb. Log., 2000

Filters, Cohen Sets and Consistent Extensions of The Erdös-Dushnik-Miller Theorem.
J. Symb. Log., 2000

Applications of PCF Theory.
J. Symb. Log., 2000

On Quantification with A Finite Universe.
J. Symb. Log., 2000

Was Sierpinski Right? IV.
J. Symb. Log., 2000

More on Entangled Orders.
J. Symb. Log., 2000

Two Consistency Results on Set Mappings.
J. Symb. Log., 2000

After All, There Are Some Inequalities Which Are Provable in ZFC.
J. Symb. Log., 2000

More on Cardinal Invariants of Boolean Algebras.
Ann. Pure Appl. Logic, 2000

Covering a Function on the Plane by Two Continuous Functions on an Uncountable Square - the Consistency.
Ann. Pure Appl. Logic, 2000

Changing cardinal characteristics without changing Omega-sequences or cofinalities.
Ann. Pure Appl. Logic, 2000

Strong Splitting in Stable Homogeneous Models.
Ann. Pure Appl. Logic, 2000

The PCF Trichotomy Theorem does not hold for short sequences.
Arch. Math. Log., 2000

Choiceless Polynominal Time Logic: Inability to Express.
Proceedings of the Computer Science Logic, 2000

1999
Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part C.
J. Symb. Log., 1999

Cardinal Preserving Ideals.
J. Symb. Log., 1999

Similar But Not The Same: Various Versions of Clubs Do Not Coincide.
J. Symb. Log., 1999

A Model With No Magic Set.
J. Symb. Log., 1999

Transfering Saturation, The Finite Cover Property, and Stability.
J. Symb. Log., 1999

Regressive Ramsey Numbers Are Ackermannian.
J. Comb. Theory, Ser. A, 1999

Canonical Models for N1-Combinatorics.
Ann. Pure Appl. Logic, 1999

Toward Categoricity for Classes with no Maximal Models.
Ann. Pure Appl. Logic, 1999

On Distinguishing Quotients of Symmetric Groups.
Ann. Pure Appl. Logic, 1999

Categoricity for Abstract Classes with Amalgamation.
Ann. Pure Appl. Logic, 1999

Choiceless Polynomial Time.
Ann. Pure Appl. Logic, 1999

Random graphs in the monadic theory of order.
Arch. Math. Log., 1999

Possible size of an ultrapower of w\omega.
Arch. Math. Log., 1999

Superatomic Boolean algebras: Maximal rigidity.
Proceedings of the Set Theory: The Hajnal Conference, 1999

1998
On the Number of Elementary Submodels of an Unsuperstable Homogeneous Structure.
Math. Log. Q., 1998

Uniformization and Skolem Functions in the Class of Trees.
J. Symb. Log., 1998

Compactness of Loeb Spaces.
J. Symb. Log., 1998

Superdestructibility: A Dual to Laver's Indestructibility.
J. Symb. Log., 1998

DOP and FCP in Generic Structures.
J. Symb. Log., 1998

Ideals without CCC.
J. Symb. Log., 1998

Erdos and Rényi Conjecture .
J. Comb. Theory, Ser. A, 1998

1997
The Cofinality Spectrum of the Infinite Symmetric Group.
J. Symb. Log., 1997

Simple Forcing Notions and Forcing Axioms.
J. Symb. Log., 1997

Peano Arithmetic Maybe Not Be Interpretable in the Monadic Theory of Linear Orders.
J. Symb. Log., 1997

The Consistency of ZFC + 2aleph0 > alephomega + F(aleph2) = F(alephomega).
J. Symb. Log., 1997

Colouring and Non-Productivity of aleph2-C.C.
Ann. Pure Appl. Logic, 1997

Can a Small Forcing Create Kurepa Trees.
Ann. Pure Appl. Logic, 1997

Sticks and Clubs.
Ann. Pure Appl. Logic, 1997

Set theory without choice: not everything on cofinality is possible.
Arch. Math. Log., 1997

1996
Very weak zero one law for random graphs with order and random binary functions.
Random Struct. Algorithms, 1996

On the Very Weak 0-1 Law for Random Graphs with Orders.
J. Log. Comput., 1996

If There Is an Exactly lambda-free Abelian Group There There Is an Exactly lambda-Separable One in lambda.
J. Symb. Log., 1996

Uniformization, Choice Functions and Well Orders in the Class of Trees.
J. Symb. Log., 1996

Forcing Isomorphism II.
J. Symb. Log., 1996

On Countably Closed Complete Boolean Algebras.
J. Symb. Log., 1996

Possible pcf Algebras.
J. Symb. Log., 1996

On Finite Rigid Structures.
J. Symb. Log., 1996

Identities on Cardinals less than alephomega.
J. Symb. Log., 1996

Adding One Random Real.
J. Symb. Log., 1996

Was Sierpinski Right? III: Can Continuum-cc. Times c.c.c. be Continuum-c.c.?
Ann. Pure Appl. Logic, 1996

In the Random Graph G(n, p), p = n-a: If psi Has Probability O(n-epsilon) for Every epsilon>0 Then it Has Probability O(e-nepsilon) for Some epsilon>0.
Ann. Pure Appl. Logic, 1996

Toward Classifying Unstable Theories.
Ann. Pure Appl. Logic, 1996

Partial Orderings with the Weak Freese-Nation Property.
Ann. Pure Appl. Logic, 1996

Saturated Filters at Successors of Singulars, Weak Reflection and Yet Another Weak Club Principle.
Ann. Pure Appl. Logic, 1996

Large normal ideals concentrating on a fixed small cardinality.
Arch. Math. Log., 1996

Localizations of infinite subsets of w.
Arch. Math. Log., 1996

More forcing notions imply diamond.
Arch. Math. Log., 1996

The tree property at successors of singular cardinals.
Arch. Math. Log., 1996

Martin's axiom and D21 well-ordering of the reals.
Arch. Math. Log., 1996

1995
Convergence in Homogeneous Random Graphs.
Random Struct. Algorithms, 1995

The Combinatorics of Combinatorial Coding by a Real.
J. Symb. Log., 1995

A Combinatorial Forcing for Coding the Universe by a Real When There Are No Sharps.
J. Symb. Log., 1995

Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part B.
J. Symb. Log., 1995

The Bounded Proper Forcing Axiom.
J. Symb. Log., 1995

A Model in Which Every Boolean Algebra Has Many Subalgebras.
J. Symb. Log., 1995

Abstract Classes with Few Models Have 'Homogeneous-Universal' Models.
J. Symb. Log., 1995

Universal Graphs without Large Cliques.
J. Comb. Theory, Ser. B, 1995

Cardinal Invariants Above the Continuum.
Ann. Pure Appl. Logic, 1995

k-universal finite graphs.
Proceedings of the Logic and Random Structures, 1995

1994
Random Sparse Unary Predicates.
Random Struct. Algorithms, 1994

Can You Feel the Double Jump?
Random Struct. Algorithms, 1994

The Strength of the Isomorphism Property.
J. Symb. Log., 1994

Constructing Strongly Equivalent Nonisomorphic Models for Unsuperstable Theories, Part A.
J. Symb. Log., 1994

Consequences of Arithmetic for Set Theory.
J. Symb. Log., 1994

Large k-preserving sets in infinite graphs.
Journal of Graph Theory, 1994

On finite rigid structures.
CoRR, 1994

McColm conjecture.
CoRR, 1994

Cardinalities of Topologies with Small Base.
Ann. Pure Appl. Logic, 1994

Essential Kurepa Trees versus Essential Jech-Kunen Trees.
Ann. Pure Appl. Logic, 1994

Universal Theories Categorical in Power and kappa-Generated Models.
Ann. Pure Appl. Logic, 1994

Erratum.
Arch. Math. Log., 1994

McColm's Conjecture
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993
Remarks on Strong Nonstructure Theorems.
Notre Dame Journal of Formal Logic, 1993

Maximal Subsets of Infinite Symmetric Groups.
Notre Dame Journal of Formal Logic, 1993

On the Number of Automorphisms of Uncountable Models.
J. Symb. Log., 1993

Pointwise Compact and Stable Sets of Measurable Functions.
J. Symb. Log., 1993

On the Existence of Atomic Models.
J. Symb. Log., 1993

Delta13-Sets of Reals.
J. Symb. Log., 1993

Strong Measure Zero Sets Without Cohen Reals.
J. Symb. Log., 1993

On Closed P-Sets with ccc in the Space omega*.
J. Symb. Log., 1993

The Cichon Diagram.
J. Symb. Log., 1993

Forcing Isomorphism.
J. Symb. Log., 1993

Models with Second Order Properties V: A General Principle.
Ann. Pure Appl. Logic, 1993

Borel Partitions of Infinite Subtrees of a Perfect Tree.
Ann. Pure Appl. Logic, 1993

More on Simple Forcing Notions and Forcings with Ideals.
Ann. Pure Appl. Logic, 1993

A Delta22 Well-Order of the Reals and Incompactness of L(QMM).
Ann. Pure Appl. Logic, 1993

Maximal chains inωω and ultrapowers of the integers.
Arch. Math. Log., 1993

More on cardinal arithmetic.
Arch. Math. Log., 1993

μ-complete Souslin trees on μ+.
Arch. Math. Log., 1993

Many simple cardinal invariants.
Arch. Math. Log., 1993

1992
The Hanf numbers of stationary logic II: Comparison with other logics.
Notre Dame Journal of Formal Logic, 1992

Nonexistence of Universal Orders in Many Cardinals.
J. Symb. Log., 1992

The Universality Spectrum of Stable Unsuperstable Theories.
Ann. Pure Appl. Logic, 1992

Combinatorial Properties of Hechler Forcing.
Ann. Pure Appl. Logic, 1992

Closed Measure Zero Sets.
Ann. Pure Appl. Logic, 1992

Con(u>i).
Arch. Math. Log., 1992

The monadic theory of (ω2, <) may be complicated.
Arch. Math. Log., 1992

Sacks forcing, Laver forcing, and Martin's axiom.
Arch. Math. Log., 1992

Intersection of ultrafilters may have measure zero.
Arch. Math. Log., 1992

1991
Forcing Minimal Degree of Constructibility.
J. Symb. Log., 1991

There Are Reasonably Nice Logics.
J. Symb. Log., 1991

The Primal Framework II: Smoothness.
Ann. Pure Appl. Logic, 1991

Reflecting stationary sets and successors of singular cardinals.
Arch. Math. Log., 1991

1990
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space
J. ACM, July, 1990

The Nonaxiomatizability of L(Q21) by Finitely Many Schemata.
Notre Dame Journal of Formal Logic, 1990

Strong Negative Partition Above the Continuum.
J. Symb. Log., 1990

The Kunen-Miller Chart (Lebesgue Measure, the Baire Property, Laver Reals and Preservation Theorems for Forcing).
J. Symb. Log., 1990

Full Reflection of Stationary Sets Below alephomega.
J. Symb. Log., 1990

Categoricity of Theories in Lk omega, with k a Compact Ordinal.
Ann. Pure Appl. Logic, 1990

The Borel Conjecture.
Ann. Pure Appl. Logic, 1990

Ramsey Ultrafilters and the Reaping Number - Con(r (DOI)
Ann. Pure Appl. Logic, 1990

The Primal Framework I.
Ann. Pure Appl. Logic, 1990

Around random algebra.
Arch. Math. Log., 1990

1989
Near Coherence of Filters III: A Simplified Consistency Proof.
Notre Dame Journal of Formal Logic, 1989

Subgroups of Small Index in Infinite Symmetric Groups II.
J. Symb. Log., 1989

The Number of Pairwise Non-Elementary-Embeddable Models.
J. Symb. Log., 1989

Uniformization Principles.
J. Symb. Log., 1989

Martin's Axioms, Measurability and Equiconsistency Results.
J. Symb. Log., 1989

Time Polynomial in Input or Output.
J. Symb. Log., 1989

On the Strength of the Interpretation Method.
J. Symb. Log., 1989

The Cofinality of Cardinal Invariants Related to Measure and Category.
J. Symb. Log., 1989

On the Existence of Regular Types.
Ann. Pure Appl. Logic, 1989

Delta12-Sets of Reals.
Ann. Pure Appl. Logic, 1989

A Dichotomy Theorem for Regular Types.
Ann. Pure Appl. Logic, 1989

Homogeneity of infinite permutation groups.
Arch. Math. Log., 1989

On certain indestructibility of strong cardinals and a question of Hajnal.
Arch. Math. Log., 1989

Nearly Linear Time.
Proceedings of the Logic at Botik '89, 1989

1988
Some notes on iterated forcing with 20>ℵ2.
Notre Dame Journal of Formal Logic, 1988

Forcing Constructions for Uncountably Chromatic Graphs.
J. Symb. Log., 1988

Souslin Forcing.
J. Symb. Log., 1988

Isomorphic but not Lower Base-Isomorphic Cylindric Set Algebras.
J. Symb. Log., 1988

A graph which embeds all small graphs on any large set of vertices.
Ann. Pure Appl. Logic, 1988

Number of strongly alephɛ-saturated models - an addition.
Ann. Pure Appl. Logic, 1988

Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987
Expected Computation Time for Hamiltonian Path Problem.
SIAM J. Comput., 1987

On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem.
Math. Oper. Res., 1987

Semiproper Forcing Axiom Implies Martin Maximum but Not PFA+.
J. Symb. Log., 1987

Extraspecial p-groups.
Ann. Pure Appl. Logic, 1987

A theorem and some consistency results in partition calculus.
Ann. Pure Appl. Logic, 1987

Existence of many L∞, λ-equivalent, non- isomorphic models of T of power λ.
Ann. Pure Appl. Logic, 1987

On the number of strongly alephε-saturated models of power λ.
Ann. Pure Appl. Logic, 1987

Uncountable groups have many nonconjugate subgroups.
Ann. Pure Appl. Logic, 1987

Combinatorial problems on trees: Partitions, δ-systems and large free subtrees.
Ann. Pure Appl. Logic, 1987

Nonconvergence, undecidability, and intractability in asymptotic problems.
Ann. Pure Appl. Logic, 1987

There may be simple Paleph1 and Paleph2-points and the Rudin-Keisler ordering may be downward directed.
Ann. Pure Appl. Logic, 1987

Remarks on superatomic boolean algebras.
Ann. Pure Appl. Logic, 1987

Threshold Spectra for Random Graphs
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986
On the nonaxiomatizability of some logics by finitely many schemas.
Notre Dame Journal of Formal Logic, 1986

On power of singular cardinals.
Notre Dame Journal of Formal Logic, 1986

Stationary logic and its friends. II.
Notre Dame Journal of Formal Logic, 1986

The Hanf number of stationary logic.
Notre Dame Journal of Formal Logic, 1986

On the Number of Nonisomorphic Models of an Infinitary Theory Which has the Infinitary Order Property, Part A.
J. Symb. Log., 1986

0 # and Some Forcing Principles.
J. Symb. Log., 1986

On the Intersection of Closed Unbounded Sets.
J. Symb. Log., 1986

Definability by Constant-Depth Polynomial-Size Circuits
Information and Control, 1986

Fixed-point extensions of first-order logic.
Ann. Pure Appl. Logic, 1986

Souslin trees and successors of singular cardinals.
Ann. Pure Appl. Logic, 1986

1985
Incompactness in regular cardinals.
Notre Dame Journal of Formal Logic, 1985

On the possible number no(M)= the number of nonisomorphic models LINFINITY, λ-equivalent to M of power λ, for λ singular.
Notre Dame Journal of Formal Logic, 1985

Classification theory over a predicate. I.
Notre Dame Journal of Formal Logic, 1985

Stationary logic and its friends. I.
Notre Dame Journal of Formal Logic, 1985

Some exact equiconsistency results in set theory.
Notre Dame Journal of Formal Logic, 1985

Second-order quantifiers and the complexity of theories.
Notre Dame Journal of Formal Logic, 1985

On the Structure of Ext(A, Z) in ZFC+.
J. Symb. Log., 1985

The Decision Problem for Branching Time Logic.
J. Symb. Log., 1985

On random models of finite power and monadic logic.
Discrete Mathematics, 1985

More on the weak diamond.
Ann. Pure Appl. Logic, 1985

Monadic logic and löwenheim numbers.
Ann. Pure Appl. Logic, 1985

Remarks in abstract model theory.
Ann. Pure Appl. Logic, 1985

Narrow boolean algebras.
Ann. Pure Appl. Logic, 1985

On the consistency of some partition theorems for continuous colorings, and the structure of aleph1-dense real order types.
Ann. Pure Appl. Logic, 1985

Fixed-Point Extensions of First-Order Logic
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
A pair of nonisomorphic ≡∞λ models of power λ for λ singular with λω=λ.
Notre Dame Journal of Formal Logic, 1984

Forcing the Failure of Ch by Adding a Real.
J. Symb. Log., 1984

More on Proper Forcing.
J. Symb. Log., 1984

Diamonds, Uniformization.
J. Symb. Log., 1984

A Decidable Subclass of the Minimal Godel Class with Identity.
J. Symb. Log., 1984

On universal graphs without instances of CH.
Ann. Pure Appl. Logic, 1984

Countably decomposable admissible sets.
Ann. Pure Appl. Logic, 1984

A nonconservativity result on global choice.
Ann. Pure Appl. Logic, 1984

Existentially closed structures in the power of the continuum.
Ann. Pure Appl. Logic, 1984

1983
On the Expressibility Hierarchy of Magidor-Malitz Quantifiers.
J. Symb. Log., 1983

On the Standard Part of Nonstandard Models of Set Theory.
J. Symb. Log., 1983

Random Models and the Godel Case of the Decision Problem.
J. Symb. Log., 1983

Rabin's Uniformization Problem.
J. Symb. Log., 1983

Interpreting Second-Order Logic in the Monadic Theory of Order.
J. Symb. Log., 1983

The Monadic Theory of omega12.
J. Symb. Log., 1983

Forcing Closed Unbounded Sets.
J. Symb. Log., 1983

Models with second order properties IV. A general method and eliminating diamonds.
Ann. Pure Appl. Logic, 1983

Positive results in abstract model theory: a theory of compact logics.
Ann. Pure Appl. Logic, 1983

Reasoning with Time and Chance (Extended Abstract).
Proceedings of the Automata, 1983

1982
Reasoning with Time and Chance
Information and Control, June, 1982

On the number of nonisomorphic models in LINFINITY , κ when κ is weakly compact.
Notre Dame Journal of Formal Logic, 1982

Forcing With Stable Posets.
J. Symb. Log., 1982

1981
On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements.
Notre Dame Journal of Formal Logic, 1981

On saturation for a predicate.
Notre Dame Journal of Formal Logic, 1981

On Fleissner's diamond.
Notre Dame Journal of Formal Logic, 1981

On the number of nonisomorphic models of cardinality λ L∞λ-equivalent to a fixed model.
Notre Dame Journal of Formal Logic, 1981

Canonization Theorems and Applications.
J. Symb. Log., 1981

Models with second order properties. III. Omitting types forL(Q).
Arch. Math. Log., 1981

1980
Independence Results.
J. Symb. Log., 1980

Independence of Strong Partition Relation for Small Cardinals, and the Free-Subset Problem.
J. Symb. Log., 1980

A Note on Cardinal Exponentiation.
J. Symb. Log., 1980

On the Elementary Equivalence of Automorphism Groups of Boolean Algebras; Downward Skolem Lowenheim Theorems and Compactness of Related Quantifiers.
J. Symb. Log., 1980

On the Temporal Basis of Fairness.
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1979
Algebraically Closed Groups of Large Cardinality.
J. Symb. Log., 1979

Hanf Number of Omitting Type for Simple First-Order Theories.
J. Symb. Log., 1979

On Uniqueness of Prime Models.
J. Symb. Log., 1979

Modest Theory of Short Chains. II.
J. Symb. Log., 1979

1978
End Extensions and Numbers of Countable Models.
J. Symb. Log., 1978

On the Number of Minimal Models.
J. Symb. Log., 1978

1976
Decomposing Uncountable Squares to Countably Many Chains.
J. Comb. Theory, Ser. A, 1976

1974
A Substitute for Hall's Theorem for Families with Infinite Sets.
J. Comb. Theory, Ser. A, 1974

1973
Weak Definability in Infinitary Languages.
J. Symb. Log., 1973

Some Counterexamples in the Partition Calculus.
J. Comb. Theory, Ser. A, 1973

1972
Israel Journal of Mathematics, March, 1972

On Models with Power-Like Ordering.
J. Symb. Log., 1972

Uniqueness and Characterization of Prime Models over Sets for Totally Transcendental First-Order Theories.
J. Symb. Log., 1972

On Power-like Models for Hyperinaccessible Cardinals.
J. Symb. Log., 1972

1970
On the Cardinality of Ultraproduct of Finite Sets.
J. Symb. Log., 1970

On Theories T Categorical in absolut T.
J. Symb. Log., 1970


  Loading...