default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 162
Volume 162, Number 1, October 2010
- M. E. Malliaris:
Edge distribution and density in the characteristic sequence. 1-19 - Peter Buser, Bruno Scarpellini:
Recursive analysis of singular ordinary differential equations. 20-35 - Bas Spitters
:
Locatedness and overt sublocales. 36-54 - Luigi Santocanale, Yde Venema:
Completeness for flat modal fixpoint logics. 55-82 - Chris J. Conidis:
A measure-theoretic proof of Turing incomparability. 83-88 - Gunter Fuchs:
Generic embeddings associated to an indestructibly weakly compact cardinal. 89-105
Volume 162, Number 2, November 2010
- Toshiyasu Arai:
Wellfoundedness proofs by means of non-monotonic inductive definitions II: First order operators. 107-143 - Jan von Plato:
Combinatorial analysis of proofs in projective and affine geometry. 144-161 - Petr Cintula, George Metcalfe:
Admissible rules in the implication-negation fragment of intuitionistic logic. 162-171
Volume 162, Number 3, December 2010
- Sergei N. Artëmov, Yuri V. Matiyasevich, Grigori Mints, Anatol Slissenko:
Preface. 173-174 - Andrey Bovykin:
Unprovability threshold for the planar graph minor theorem. 175-181 - Vasco Brattka, Ruth Dillhage:
Computability of finite-dimensional linear subspaces and best approximation. 182-193 - Dima Grigoriev, Vladimir Shpilrain:
Authentication schemes from actions on graphs, groups, or rings. 194-200 - Rosalie Iemhoff:
The eskolemization of universal quantifiers. 201-212 - Dmitry Itsykson:
Structural complexity of AvgBPP. 213-223 - Leonid A. Levin:
Some theorems on the algorithmic approach to probability theory and information theory: (1971 Dissertation directed by A.N. Kolmogorov). 224-235 - Nikolai A. Shanin:
Referee's report on Leonid Levin's dissertation "Some Theorems on the Algorithmic Approach to Probability Theory and Information Theory" (November 27, 1972). 236 - Grigori Mints:
Cut-free formulations for a quantified logic of here and there. 237-242 - Yiannis N. Moschovakis:
Classical descriptive set theory as a refinement of effective descriptive set theory. 243-255
Volume 162, Number 4, January 2011
- Gunter Fuchs:
lambda-structures and s-structures: Translating the models. 257-317 - Olivia Caramello:
A characterization theorem for geometric logic. 318-321 - Emil Jerábek:
On theories of bounded arithmetic for NC1. 322-340 - Emil Jerábek:
A sorting network in bounded arithmetic. 341-355
Volume 162, Number 5, February - March 2011
- Yun Fan, Liang Yu:
Maximal pairs of c.e. reals in the computably Lipschitz degrees. 357-366 - Uri Andrews:
New spectra of strongly minimal theories in finite languages. 367-372 - Athanassios Tzouvaras:
A combinatorial result related to the consistency of New Foundations. 373-383 - Yimu Yin:
Integration in algebraically closed valued fields. 384-408
Volume 162, Number 6, April - May 2011
- Margaret E. M. Thomas:
An o-minimal structure without mild parameterization. 409-418 - Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen:
The provably total NP search problems of weak second order bounded arithmetic. 419-446 - Paola D'Aquino, Angus Macintyre:
Quadratic forms in models of IΔ0+Ω1, Part II: Local equivalence. 447-456 - Jana Maríková:
O-minimal residue fields of o-minimal fields. 457-464 - George Barmpalias, André Nies:
Upper bounds on ideals in the computably enumerable Turing degrees. 465-473 - David M. Evans, Marco S. Ferreira:
The geometry of Hrushovski constructions, I: The uncollapsed case. 474-488
Volume 162, Number 7, June - July 2011
- Joan Bagaria, Yiannis N. Moschovakis, Margarita Otero, Ivan N. Soskov:
Preface. 489 - Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Σ01 and Π01 equivalence structures. 490-503 - Antonín Kucera, André Nies:
Demuth randomness and computational complexity. 504-513 - Antongiulio Fornasiero:
Dimensions, matroids, and dense pairs of first-order structures. 514-543 - Alf Onshuus, Alexander Usvyatsov:
Stable domination and weight. 544-560 - Benjamin D. Miller:
Dichotomy theorems for countably infinite dimensional analytic hypergraphs. 561-565 - Assaf Rinot:
On guessing generalized clubs at the successors of regulars. 566-577
Volume 162, Number 8, August 2011
- Kentaro Sato:
The strength of extensionality II - Weak weak set theories without infinity. 579-646 - Gerhard Jäger, Dieter Probst:
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories. 647-660 - Isabel Oitavem:
A recursion-theoretic approach to NP. 661-666 - Barbara F. Csima, Reed Solomon:
The complexity of central series in nilpotent computable groups. 667-678
Volume 162, Number 9, September 2011
- Chuck C. Liang, Dale Miller:
A focused approach to combining logics. 679-697 - Byunghan Kim, Hyeung-Joon Kim:
Notions around tree property 1. 698-709 - Gunter Fuchs:
λ-structures and s-structures: Translating the iteration strategies. 710-751 - Teruyuki Yorioka:
A correction to "A non-implication between fragments of Martin's Axiom related to a property which comes from Aronszajn trees". 752-754 - Philip Scowcroft:
Some model-theoretic correspondences between dimension groups and AF algebras. 755-785
Volume 162, Number 10, October 2011
- Peter Koepke, Philip D. Welch:
Global square and mutual stationarity at the alephn. 787-806 - Toshiyasu Arai:
Quick cut-elimination for strictly positive cuts. 807-815 - Norihiro Kamide, Heinrich Wansing:
Completeness and cut-elimination theorems for trilattice logics. 816-835 - Hans Schoutens:
Classifying singularities up to analytic extensions of scalars is smooth. 836-852
Volume 162, Number 11, November 2011
- Vera Fischer, Sy-David Friedman, Lyubomyr Zdomskyy:
Projective wellorders and mad families with large continuum. 853-862 - I. Sharpe, Philip D. Welch:
Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties. 863-902 - Michael J. Lieberman:
Category-theoretic aspects of abstract elementary classes. 903-915 - Alexei G. Myasnikov, Mahmood Sohrabi:
Groups elementarily equivalent to a free nilpotent group of finite rank. 916-933 - Dieter Probst:
The provably terminating operations of the subsystem PETJ of explicit mathematics. 934-947 - Predrag Tanovic:
Minimal first-order structures. 948-957
Volume 162, Number 12, December 2011
- Sara Miner More, Pavel Naumov:
Logic of secrets in collaboration networks. 959-969 - Longyun Ding:
Borel reducibility and finitely Hölder(α) embeddability. 970-980 - Leszek Aleksander Kolodziejczyk:
Independence results for variants of sharply bounded induction. 981-990 - Sergey Babenyshev, Vladimir V. Rybakov:
Unification in linear temporal logic LTL. 991-1000 - Stefan Hetzl, Alexander Leitsch, Daniel Weller:
CERES in higher-order logic. 1001-1034 - Daniele Mundici:
Finite axiomatizability in Łukasiewicz logic. 1035-1047
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
