default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Pure and Applied Logic, Volume 163
Volume 163, Number 1, January 2012
- Pierre Matet, Toshimichi Usuba:
Two-cardinal versions of weak compactness: Partitions of pairs. 1-22 - Timothy J. Carlson, Gunnar Wilken
:
Tracking chains of Σ2-elementarity. 23-67 - Pietro Galliani:
Inclusion and exclusion dependencies in team semantics - On some logics of imperfect information. 68-84
Volume 163, Number 2, February 2012
- Andrej Bauer, Thierry Coquand, Giovanni Sambin, Peter M. Schuster:
Preface. 85-86 - Andrej Bauer, Davorin Lesnik:
Metric spaces in synthetic topology. 87-100 - Douglas S. Bridges:
Reflections on function spaces. 101-110 - Francesco Ciraulo:
A constructive investigation of satisfiability. 111-121 - Peter Dybjer, Denis Kuperberg:
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation. 122-131 - Hajime Ishihara:
Two subcategories of apartness spaces. 132-139 - Claudio Sacerdoti Coen, Enrico Zoli:
Lebesgue's dominated convergence theorem in Bishop's style. 140-150 - Silvio Valentini:
Independence results in formal topology. 151-156 - Steven Vickers:
Cosheaves and connectedness in formal topology. 157-174 - Albert Ziegler:
Generalizing realizability and Heyting models for constructive set theory. 175-184
Volume 163, Number 3, March 2012
- Dilip Raghavan, Stevo Todorcevic:
Cofinal types of ultrafilters. 185-199 - Marc Bezem, Clemens Grabmayer, Michal Walicki:
Expressive power of digraph solvability. 200-213 - Liang Yu:
Characterizing strong randomness via Martin-Löf randomness. 214-224 - Ioannis A. Souldatos:
Linear orderings and powers of characterizable cardinals. 225-237 - Michele Pagani:
Visible acyclic differential nets, Part I: Semantics. 238-265 - Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui:
Algebraic proof theory for substructural logics: Cut-elimination and completions. 266-290 - Melvin Fitting:
Prefixed tableaus and nested sequents. 291-313 - David Diamondstone:
Low upper bounds in the LR degrees. 314-320 - Paul Shafer:
Coding true arithmetic in the Medvedev degrees of Π10 classes. 321-337 - Willem Conradie, Alessandra Palmigiano:
Algorithmic correspondence and canonicity for distributive modal logic. 338-376 - Giorgi Japaridze:
Separating the basic logics of the basic recurrences. 377-389
Volume 163, Number 4, April 2012
- Vera Koponen:
Asymptotic probabilities of extension properties and random l-colourable structures. 391-438 - Norihiro Kamide:
Bounded linear-time temporal logic: A proof-theoretic investigation. 439-466 - David Fernández-Duque:
Tangled modal logic for topological dynamics. 467-481
Volume 163, Number 5, May 2012
- Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe:
Computability in Europe 2009. 483-484 - P. E. Alaev:
Computably categorical Boolean algebras enriched by ideals and atoms. 485-499 - George Barmpalias:
Tracing and domination in the Turing degrees. 500-505 - Laurent Bienvenu, Joseph S. Miller:
Randomness and lowness notions via open covers. 506-518 - David Diamondstone, Bjørn Kjos-Hanssen:
Martin-Löf randomness and Galton-Watson processes. 519-529 - Cameron E. Freer, Daniel M. Roy:
Computable de Finetti measures. 530-546 - Hristo Ganchev, Mariya Ivanova Soskova:
The high/low hierarchy in the local structure of the omega-enumeration degrees. 547-566 - Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi:
Empty intervals in the enumeration degrees. 567-574 - Dag Normann, Vladimir Yu. Sazonov:
The extensional ordering of the sequential functionals. 575-603 - Pavel Pudlák, Neil Thapen:
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic. 604-614 - Alla Sirokofskich:
Decidability questions for a ring of Laurent polynomials. 615-619
Volume 163, Number 6, June 2012
- Fernando Ferreira, Martin Hyland, Benedikt Löwe, Elvira Mayordomo:
Computability in Europe 2010. 621-622 - Vasco Brattka, Guido Gherardi, Alberto Marcone:
The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma. 623-655 - Stefan S. Dantchev, Barnaby Martin:
The limits of tractability in Resolution-based propositional proof systems. 656-668 - Michiel De Smet, Andreas Weiermann:
Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal. 669-680 - Martín Hötzel Escardó, Paulo Oliva:
The Peirce translation. 681-692 - Kojiro Higuchi:
Effectively closed mass problems and intuitionism. 693-697 - Lars Kristiansen, Jan-Christoph Schlage-Puchta, Andreas Weiermann:
Streamlined subrecursive degree theory. 698-716 - Jiang Liu, Guohua Wu:
Almost universal cupping and diamond embeddings. 717-729 - Rebecca M. Steiner:
Computable fields and the bounded Turing reduction. 730-742
Volume 163, Number 7, July 2012
- Sergei N. Artëmov, Anil Nerode:
Preface. 743-744 - James Worthington:
A bialgebraic approach to automata and formal language theory. 745-762 - K. Tadaki:
Fixed point theorems on partial randomness. 763-774 - Yury Savateev:
Product-free Lambek calculus is NP-complete. 775-788 - Wojciech Moczydlowski:
Unifying sets and programs via dependent types. 789-808 - Robert Saxon Milnikel:
Conservativity for logics of justified belief: Two approaches. 809-819 - Robert S. Lubarsky:
Topological forcing semantics with settling. 820-830 - Hidenori Kurokawa:
Tableaux and hypersequents for justification logics. 831-853 - Max I. Kanovich:
Light linear logics with controlled weakening: Expressibility, confluent strong normalization. 854-874 - Antoine Genitrini, Jakub Kozik:
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. 875-887 - Samuel R. Buss, Roman Kuznets:
Lower complexity bounds in justification logic. 888-905 - Samuel R. Buss:
Towards NP-P via proof complexity and search. 906-917 - Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto:
A relational semantics for parallelism and non-determinism in a functional setting. 918-934 - Eduardo Bonelli, Federico Feller:
Justification Logic as a foundation for certifying mobile computation. 935-950 - Anna Zamansky, Arnon Avron:
Canonical signed calculi with multi-ary quantifiers. 951-960 - Carlos Areces, Santiago Figueira, Sergio Mera:
Completeness results for memory logics. 961-972
Volume 163, Number 8, August 2012
- Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen:
Foreword. 973-974 - Josef Berger, Hajime Ishihara, Erik Palmgren, Peter Schuster:
A predicative completion of a uniform space. 975-980 - Josef Berger:
Aligning the weak König lemma, the uniform continuity theorem, and Brouwer's fan theorem. 981-985 - Vasco Brattka, Matthew de Brecht, Arno Pauly:
Closed choice and a Uniform Low Basis Theorem. 986-1008 - Douglas S. Bridges:
Almost new pre-apartness from old. 1009-1015 - Ernst-Erich Doberkat:
Lattice properties of congruences for stochastic relations. 1016-1029 - Gilda Ferreira, Paulo Oliva:
On bounded functional interpretations. 1030-1049 - Matthew Hendtlass:
The intermediate value theorem in constructive mathematics without choice. 1050-1056 - Hajime Ishihara:
The uniform boundedness theorem and a boundedness principle. 1057-1061 - Bernhard Reus, Thomas Streicher:
A synthetic theory of sequential domains. 1062-1074 - Victor L. Selivanov:
Fine hierarchies via Priestley duality. 1075-1107 - Martin Ziegler:
Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra. 1108-1139
Volume 163, Number 9, September 2012
- Tapani Hyttinen, Meeri Kesälä:
Interpreting groups and fields in simple, finitary AECs. 1141-1162 - Samuel R. Buss, Alan S. Johnson:
Propositional proofs and reductions between NP search problems. 1163-1182 - Patrícia Engrácia:
The bounded functional interpretation of bar induction. 1183-1195 - John D. Clemens:
Isometry of Polish metric spaces. 1196-1209 - Daniel de Carvalho, Lorenzo Tortora de Falco:
The relational model is injective for multiplicative exponential linear logic (without weakenings). 1210-1236 - Arthur W. Apter, Moti Gitik, Grigor Sargsyan:
Indestructible strong compactness but not supercompactness. 1237-1242 - Damir D. Dzhafarov, Carl Mummert:
Reverse mathematics and properties of finite character. 1243-1251 - Peter Cholak, Peter M. Gerdes, Karen M. Lange:
On n-tardy sets. 1252-1270 - Remo Goetschi, Roman Kuznets:
Realization for justification logics via nested sequents: Modularity through embedding. 1271-1298 - Milos S. Kurilic, Stevo Todorcevic:
Forcing by non-scattered sets. 1299-1308 - Vincenzo Dimonte:
A partially non-proper ordinal beyond L(Vλ+1). 1309-1321 - H. Jerome Keisler, Jeffrey M. Keisler:
Craig interpolation for networks of sentences. 1322-1344 - Jörg Brendle, Yurii Khomskii:
Polarized partitions on the second level of the projective hierarchy. 1345-1357 - Eduardo J. Dubuc:
Erratum to "Representation theory of MV-algebras" [Ann. Pure Appl. Logic 161 (8) (2010)]. 1358
Volume 163, Number 10, October 2012
- Juliette Kennedy, Jaap van Oosten:
Preface. 1359 - Tatiana Arrigoni, Sy-David Friedman:
Foundational implications of the Inner Model Hypothesis. 1360-1366 - Benno van den Berg, Ieke Moerdijk:
Derived rules for predicative set theory: An application of sheaves. 1367-1383 - Erik Palmgren:
Constructivist and structuralist foundations: Bishop's and Lawvere's theories of sets. 1384-1399 - Michael Rathjen:
From the weak to the strong existence property. 1400-1418 - Alex K. Simpson, Thomas Streicher:
Constructive toposes with countable sums as models of constructive set theory. 1419-1436 - Nik Weaver:
Intuitionism and the liar paradox. 1437-1445
Volume 163, Number 11, November 2012
- Federico Aschieri:
A constructive analysis of learning in Peano Arithmetic. 1448-1470 - Giovanni Curi:
Topological inductive definitions. 1471-1483 - Kentaro Fujimoto:
Classes and truths in set theory. 1484-1523 - Misha Gavrilovich:
Covers of Abelian varieties as analytic Zariski structures. 1524-1548 - Danko Ilik:
Delimited control operators prove Double-negation Shift. 1549-1559 - Ulrich Kohlenbach:
Gödel functional interpretation and weak compactness. 1560-1579 - M. E. Malliaris:
Independence, order, and the interaction of ultrafilters and theories. 1580-1595 - André Nies:
Computably enumerable sets below random sets. 1596-1610 - Greg Restall:
A cut-free sequent system for two-dimensional modal logic, and why it matters. 1611-1623 - Lynn Scow:
Characterization of NIP theories by ordered graph-indiscernibles. 1624-1641 - Alex Simpson:
Measure, randomness and sublocales. 1642-1659 - Matteo Viale:
Guessing models and generalized Laver diamond. 1660-1678 - Sean Walsh:
Comparing Peano arithmetic, Basic Law V, and Hume's Principle. 1679-1709 - Christoph Weiß:
The combinatorial essence of supercompactness. 1710-1717
Volume 163, Number 12, December 2012
- Tamar Lando:
Dynamic measure logic. 1719-1737 - Sy-David Friedman, Radek Honzik:
Easton's theorem and large cardinals from the optimal hypothesis. 1738-1747 - Janusz Pawlikowski, Marcin Sabok:
Decomposing Borel functions and structure at finite levels of the Baire hierarchy. 1748-1764 - Robert Solovay, R. D. Arthan, John Harrison:
Some new results on decidability for elementary algebra and geometry. 1765-1802 - Peter Lietz, Thomas Streicher:
Realizability models refuting Ishihara's boundedness principle. 1803-1807 - Thomas Seiller:
Interaction graphs: Multiplicatives. 1808-1837 - Kai Brünnler, Thomas Studer:
Syntactic cut-elimination for a fragment of the modal mu-calculus. 1838-1853 - Jeremy Avigad, Edward T. Dean, Jason M. Rute:
Algorithmic randomness, reverse mathematics, and the dominated convergence theorem. 1854-1864 - Santi Spadaro:
On two topological cardinal invariants of an order-theoretic flavour. 1865-1871 - Joel David Hamkins, Greg Kirmayer, Norman Lewis Perlmutter:
Generalizations of the Kunen inconsistency. 1872-1890 - Kota Takeuchi, Akito Tsuboi:
On the existence of indiscernible trees. 1891-1902 - Tobias Kaiser:
First order tameness of measures. 1903-1927 - Tin Perkov, Mladen Vukovic:
Some characterization and preservation theorems in modal logic. 1928-1939 - Dion Coumans:
Generalising canonical extension to the categorical setting. 1940-1961 - Benno van den Berg, Eyvind Martol Briseid, Pavol Safarik:
A functional interpretation for nonstandard arithmetic. 1962-1994 - Lutz Straßburger:
Extension without cut. 1995-2007 - Tibor Beke, Jirí Rosický:
Abstract elementary classes and accessible categories. 2008-2017
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 2025-02-26 20:35 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:
