海量图书期刊资源,随时随地畅享阅读乐趣
Weakly minimal formulas: a global approachLudomir Newelski · 1990
Meager forkingLudomir Newelski · 1994
Vaught’s conjecture for some meager groupsLudomir Newelski · 1999
G-compactness and groupsJakub Gismatullin; Ludomir Newelski · 2008
An essay on model theoryLudomir Newelski · Central European Journal of Mathematics · 2003
Free sets for some special set mappingsLudomir Newelski · 1987
Independence results for uncountable superstable theoriesLudomir Newelski · 1989
Very simple theories without forkingLudomir Newelski · Archive for Mathematical Logic · 2003
Computability and λ-DefinabilityA. M. Turing · The Journal of Symbolic Logic · 1937
Definability and Decision Problems in ArithmeticJulia Robinson · The Journal of Symbolic Logic · 1949
Arithmetical Problems and Recursively Enumerable PredicatesMartin Davis · The Journal of Symbolic Logic · 1953
The Interpretability Logic of Peano ArithmeticAlessandro Berarducci · The Journal of Symbolic Logic · 1990
Steps Toward a Constructive NominalismNelson Goodman and W. V. Quine · The Journal of Symbolic Logic · 1947
A Completeness Theorem in Modal LogicSaul A. Kripke · The Journal of Symbolic Logic · 1959
Models and RealityHilary Putnam · The Journal of Symbolic Logic · 1980
A Theory of Restricted Quantification ITheodore Hailperin · The Journal of Symbolic Logic · 1957