海量图书期刊资源,随时随地畅享阅读乐趣
Logical Definability of Counting FunctionsKevin J. Compton; Erich Grädel · 1996
Stratified least fixpoint logicKevin J. Compton · 1994
An Undecidable Problem in Finite CombinatoricsKevin J. Compton · The Journal of Symbolic Logic · 1984
Some useful preservation theoremsCompton, Kevin J. · The Journal of Symbolic Logic · 1983
0–1 laws for mapsEdward A. Bender; Kevin J. Compton; L. Bruce Richmond · 1999
Nonconvergence, undecidability, and intractability in asymptotic problemsKevin J. Compton; C. Ward Henson; Saharon Shelah · 1987
An algebra and a logic for NC1Kevin J. Compton; Claude Laflamme · 1990
The computational complexity of asymptotic problems I: Partial ordersKevin J. Compton · 1988
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