default search action
Annals of Pure and Applied Logic, Volume 164
Volume 164, Number 1, January 2013
- Yimu Yin:
Integration in algebraically closed valued fields with sections. 1-29 - Dietrich Kuske, Jiamou Liu
, Markus Lohrey:
The isomorphism problem for ω-automatic trees. 30-48 - Gregor Dolinar, Mirna Dzamonja
Forcing □ω1 with finite conditions. 49-64 - Philip Scowcroft:
Erratum to "Elimination of unbounded quantifiers for some poly-regular groups of infinite rank" [Ann. Pure Appl. Logic 149 (1-3) (2007) 40-80]. 65
Volume 164, Number 2, February 2013
- Jason A. Schanker:
Partial near supercompactness. 67-85 - Chuck C. Liang, Dale Miller
Kripke semantics and proof systems for combining intuitionistic logic and classical logic. 86-111 - Ciro Russo
An order-theoretic analysis of interpretations among propositional deductive systems. 112-130 - Monica Van Dieren
Erratum to "Categoricity in abstract elementary classes with no maximal models" [Ann. Pure Appl. Logic 141 (2006) 108-147]. 131-133
Volume 164, Number 3, March 2013
- Adi Jarden, Saharon Shelah
Non-forking frames in abstract elementary classes. 135-191 - Vincenzo Marra
Duality, projectivity, and unification in Łukasiewicz logic and MV-algebras. 192-210 - Antongiulio Fornasiero
Locally o-minimal structures and structures with locally o-minimal open core. 211-229 - Lauri Keskinen:
Characterizing all models in infinite cardinalities. 230-250 - James G. Raftery:
Order algebraizable logics. 251-283 - Stephen G. Simpson
Reverse mathematics and Peano categoricity. 284-293 - Pierre Simon:
Distal and non-distal NIP theories. 294-318 - Steven Awodey, Henrik Forssell:
First-order logical duality. 319-348 - Antonio Di Nola, Anna R. Ferraioli, Giacomo Lenzi
Algebraically closed MV-algebras and their sheaf representation. 349-355 - Matthew de Brecht:
Quasi-Polish spaces. 356-381 - Sy-David Friedman, Michael Rathjen, Andreas Weiermann
Slow consistency. 382-393
Volume 164, Number 4, April 2013
- Peter Aczel:
Rudimentary and arithmetical constructive set theory. 396-415 - Douglas S. Bridges:
Characterising dominated weak-operator continuous functionals on subspaces of B(H). 416-420 - Francesco Ciraulo
Regular opens in constructive topology and a representation theorem for overlap algebras. 421-436 - Thierry Coquand:
About Goodman's Theorem. 437-442 - Kosta Dosen, Zoran Petric:
Syntax for split preorders. 443-481 - Hajime Ishihara:
Relating Bishop's function spaces to neighbourhood spaces. 482-490 - Peter Schroeder-Heister:
Definitional Reflection and Basic Logic. 491-501 - Silvio Valentini:
Cantor theorem and friends, in logical form. 502-508
Volume 164, Number 5, May 2013
- Sam Buss, Benedikt Löwe, Dag Normann, Ivan N. Soskov:
Computability in Europe 2011. 509-510 - Frank Stephan
Highness, locally noncappability and nonboundings. 511-522 - Philipp Schlicht
Automata on ordinals and automaticity of linear orders. 523-527 - Sam Sanders:
Reverse-engineering Reverse Mathematics. 528-541 - Mathieu Hoyrup:
Computability of the ergodic decomposition. 542-549 - Ivan Georgiev
Conditional computability of real functions with respect to a class of operators. 550-565 - Amin Farjudian
On the Kolmogorov complexity of continuous real functions. 566-576 - Klaus Ambos-Spies, Philipp Bodewig, Yun Fan, Thorsten Kräling:
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent. 577-588
Volume 164, Number 6, June 2013
- Steffen van Bakel
Preface. 589-590 - Federico Aschieri:
Learning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness. 591-617 - José Espírito Santo
Towards a canonical classical natural deduction system. 618-650 - Danko Ilik
Continuation-passing style models complete for intuitionistic logic. 651-662 - Reinhard Kahle
Applicative theories for the polynomial hierarchy of time and its levels. 663-675 - Herman Geuvers, Robbert Krebbers, James McKinna:
The λμT-calculus. 676-701 - Richard McKinley
Canonical proof nets for classical logic. 702-732 - Grigori Mints:
Epsilon substitution for first- and second-order predicate logic. 733-739 - Helmut Schwichtenberg, Christoph Senjak:
Minimal from classical proofs. 740-748
Volume 164, Numbers 7-8, August 2013
- Yasuo Yoshinobu:
Operations, climbability and the proper forcing axiom. 749-762 - Vera Fischer
Cardinal characteristics, projective wellorders and large continuum. 763-770 - Sergei Odintsov, Vladimir V. Rybakov
Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic IPC+. 771-784 - David Fernández-Duque
Hyperations, Veblen progressions and transfinite iteration of ordinal functions. 785-801 - Jan Cz. Dobrowolski
On ω-categorical, generically stable groups and rings. 802-812 - Gerhard Jäger:
Operational closure and stability. 813-821 - Asher M. Kach, Karen M. Lange, Reed Solomon:
Degrees of orders on torsion-free Abelian groups. 822-836
Volume 164, Number 9, September 2013
- Pavel Semukhin
Automatic models of first order theories. 837-854 - Moti Gitik, Saharon Shelah
Applications of pcf for mild large cardinals to elementary embeddings. 855-865 - Sori Lee
Basic subtoposes of the effective topos. 866-883 - Jannis Bulian, Ian M. Hodkinson
Bare canonicity of representable cylindric and polyadic algebras. 884-906
Volume 164, Number 10, October 2013
- Cameron Donnay Hill:
Super/rosy LkLk-theories and classes of finite structures. 907-927 - Steven Awodey, Pieter J. W. Hofstra, Michael A. Warren:
Martin-Löf complexes. 928-956 - Pieter J. W. Hofstra, Michael A. Warren:
Combinatorial realizability models of type theory. 957-988 - Arno Fehm:
Elementary geometric local-global principles for fields. 989-1008 - Graham E. Leigh:
A proof-theoretic account of classical principles of truth. 1009-1024 - Rutger Kuyper:
Natural factors of the Muchnik lattice capturing IPC. 1025-1036
Volume 164, Number 11, November 2013
- Samson Abramsky
Foreword. 1037 - Martin Churchill, Jim Laird
Imperative programs as proofs via game semantics. 1038-1078 - Bob Coecke, Edward Grefenstette, Mehrnoosh Sadrzadeh
Lambek vs. Lambek: Functorial vector space semantics and string diagrams for Lambek calculus. 1079-1100 - Juha Kontinen
Axiomatizing first-order consequences in dependence logic. 1101-1117 - Andrzej S. Murawski, Nikos Tzevelekos:
Full abstraction for Reduced ML. 1118-1143 - Thanos Tsouanas:
A game semantics for disjunctive logic programming. 1144-1175
Volume 164, Number 12, December 2013
- Klaus Ambos-Spies, Joan Bagaria
Preface. 1177 - David Asperó, Sy-David Friedman, Miguel Angel Mota, Marcin Sabok:
Baumgartner's conjecture and bounded forcing axioms. 1178-1186 - George Barmpalias
Kolmogorov complexity and computably enumerable sets. 1187-1200 - Lev D. Beklemishev
Topological completeness of the provability logic GLP. 1201-1223 - Yijia Chen, Jörg Flum, Moritz Müller:
Consistency, optimality, and incompleteness. 1224-1235 - Raf Cluckers
Uniformly defining valuation rings in Henselian valued fields with finite or pseudo-finite residue fields. 1236-1246 - Sy-David Friedman, Radek Honzik
Fusion and large cardinal preservation. 1247-1273 - Lew Gordeev:
Proof-theoretic conservations of weak weak intuitionistic constructive set theories. 1274-1292 - Alex Hill
An Analogy Principle in Inductive Logic. 1293-1321 - Itay Kaplan
Chain conditions in dependent groups. 1322-1337 - Hannes Leitgeb:
Reducing belief simpliciter to degrees of belief. 1338-1389 - Jordi Lopez-Abad
Large cardinals and basic sequences. 1390-1417 - Martin Otto:
Expressive completeness through logically tractable models. 1418-1453 - Luca Motto Ros
The descriptive set-theoretical complexity of the embeddability relation on models of large size. 1454-1492 - Andreas Weiermann
Goodstein sequences for prominent ordinals up to the ordinal of Π11-CA0. 1493-1506 - Martin Ziegler:
An exposition of Hrushovski's New Strongly Minimal Set. 1507-1519
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-12-19 22:03 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: