海量图书期刊资源,随时随地畅享阅读乐趣
Prime models of finite computable dimensionSemukhin, Pavel · The Journal of Symbolic Logic · 2009
Finite automata presentable abelian groupsAndré Nies; Pavel Semukhin · 2009
Uncountable automatic classes and learningSanjay Jain; Qinglong Luo; Pavel Semukhin; Frank Stephan · 2011
PrefacePotapov, Igor; Semukhin, Pavel · International Journal of Foundations of Computer Science · 2018
(Pi^0_1)-Presentations of AlgebrasBakhadyr Khoussainov; Theodore Slaman; Pavel Semukhin · Archive for Mathematical Logic · 2006
Automatic models of first order theoriesSemukhin, Pavel; Stephan, Frank · Annals of Pure and Applied Logic · 2013
Vector and scalar reachability problems inPotapov, Igor; Semukhin, Pavel · Journal of Computer and System Sciences · 2018
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