The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Ann. Pure Appl. Logic"( http://dblp.L3S.de/Venues/Ann._Pure_Appl._Logic )

URL (DBLP): http://dblp.uni-trier.de/db/journals/apal

Publication years (Num. hits)
1989 (61) 1990 (53) 1991 (53) 1992 (38) 1993 (82) 1994 (52) 1995 (60) 1996 (66) 1997 (84) 1998 (52) 1999 (55) 2000 (52) 2001 (85) 2002 (42) 2003 (55) 2004 (78) 2005 (75) 2006 (125) 2007 (57) 2008 (73) 2009 (113) 2010 (92) 2011 (46) 2012 (75)
Publication types (Num. hits)
article(1624)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 1624 publication records. Showing 1624 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Samuel R. Buss Towards NP-P via proof complexity and search. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Wojciech Moczydlowski Unifying sets and programs via dependent types. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vasco Brattka, Guido Gherardi, Alberto Marcone The Bolzano-Weierstrass Theorem is the jump of Weak Kőnig's Lemma. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Liang Yu Characterizing strong randomness via Martin-Löf randomness. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto A relational semantics for parallelism and non-determinism in a functional setting. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andrej Bauer, Davorin Lesnik Metric spaces in synthetic topology. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1George Barmpalias Tracing and domination in the Turing degrees. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Josef Berger Aligning the weak König lemma, the uniform continuity theorem, and Brouwer's fan theorem. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hidenori Kurokawa Tableaux and hypersequents for justification logics. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Bernhard Reus, Thomas Streicher A synthetic theory of sequential domains. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Steven Vickers Cosheaves and connectedness in formal topology. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Matthew Hendtlass The intermediate value theorem in constructive mathematics without choice. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Timothy J. Carlson, Gunnar Wilken Tracking chains of Σ2-elementarity. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Peter Dybjer, Denis Kuperberg Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Silvio Valentini Independence results in formal topology. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe Computability in Europe 2009. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fernando Ferreira, Martin Hyland, Benedikt Löwe, Elvira Mayordomo Computability in Europe 2010. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paul Shafer Coding true arithmetic in the Medvedev degrees of Π10 classes. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Yury Savateev Product-free Lambek calculus is NP-complete. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hajime Ishihara Two subcategories of apartness spaces. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Francesco Ciraulo A constructive investigation of satisfiability. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1David Diamondstone Low upper bounds in the LR degrees. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Albert Ziegler Generalizing realizability and Heyting models for constructive set theory. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Douglas S. Bridges Reflections on function spaces. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Martin Ziegler Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ioannis Souldatos Linear orderings and powers of characterizable cardinals. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui Algebraic proof theory for substructural logics: Cut-elimination and completions. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anna Zamansky, Arnon Avron Canonical signed calculi with multi-ary quantifiers. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jiang Liu 0002, Guohua Wu Almost universal cupping and diamond embeddings. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Joseph S. Miller Randomness and lowness notions via open covers. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vasco Brattka, Matthew de Brecht, Arno Pauly Closed choice and a Uniform Low Basis Theorem. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1James Worthington A bialgebraic approach to automata and formal language theory. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vera Koponen Asymptotic probabilities of extension properties and random l-colourable structures. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1K. Tadaki Fixed point theorems on partial randomness. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robert S. Lubarsky Topological forcing semantics with settling. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sergei N. Artëmov, Anil Nerode Preface. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1David Diamondstone, Bjørn Kjos-Hanssen Martin-Löf randomness and Galton-Watson processes. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Claudio Sacerdoti Coen, Enrico Zoli Lebesgue's dominated convergence theorem in Bishop's style. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Martín Hötzel Escardó, Paulo Oliva The Peirce translation. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Victor L. Selivanov Fine hierarchies via Priestley duality. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Douglas S. Bridges Almost new pre-apartness from old. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ulrich Berger, Vasco Brattka, Andrei S. Morozov, Dieter Spreen Foreword. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hristo Ganchev, Mariya Ivanova Soskova The high/low hierarchy in the local structure of the omega-enumeration degrees. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1P. E. Alaev Computably categorical Boolean algebras enriched by ideals and atoms. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Willem Conradie, Alessandra Palmigiano Algorithmic correspondence and canonicity for distributive modal logic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Cameron E. Freer, Daniel M. Roy Computable de Finetti measures. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stefan S. Dantchev, Barnaby Martin The limits of tractability in Resolution-based propositional proof systems. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Samuel R. Buss, Roman Kuznets Lower complexity bounds in justification logic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Rebecca M. Steiner Computable fields and the bounded Turing reduction. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Melvin Fitting Prefixed tableaus and nested sequents. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Kojiro Higuchi Effectively closed mass problems and intuitionism. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michele Pagani Visible acyclic differential nets, Part I: Semantics. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi Empty intervals in the enumeration degrees. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gilda Ferreira, Paulo Oliva On bounded functional interpretations. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pierre Matet, Toshimichi Usuba Two-cardinal versions of weak compactness: Partitions of pairs. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andrej Bauer, Thierry Coquand, Giovanni Sambin, Peter M. Schuster Preface. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pavel Pudlák, Neil Thapen Alternating minima and maxima, Nash equilibria and Bounded Arithmetic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Josef Berger, Hajime Ishihara, Erik Palmgren, Peter Schuster A predicative completion of a uniform space. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1David Fernández Duque Tangled modal logic for topological dynamics. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Carlos Areces, Santiago Figueira, Sergio Mera Completeness results for memory logics. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pietro Galliani Inclusion and exclusion dependencies in team semantics - On some logics of imperfect information. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1D. Normann, Vladimir Yu. Sazonov The extensional ordering of the sequential functionals. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marc Bezem, Clemens Grabmayer, Michal Walicki Expressive power of digraph solvability. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ernst-Erich Doberkat Lattice properties of congruences for stochastic relations. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alla Sirokofskich Decidability questions for a ring of Laurent polynomials. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Antoine Genitrini, Jakub Kozik In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hajime Ishihara The uniform boundedness theorem and a boundedness principle. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Giorgi Japaridze Separating the basic logics of the basic recurrences. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Norihiro Kamide Bounded linear-time temporal logic: A proof-theoretic investigation. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Lars Kristiansen, Jan-Christoph Schlage-Puchta, Andreas Weiermann Streamlined subrecursive degree theory. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michiel De Smet, Andreas Weiermann Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dilip Raghavan, Stevo Todorcevic Cofinal types of ultrafilters. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Max I. Kanovich Light linear logics with controlled weakening: Expressibility, confluent strong normalization. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Eduardo Bonelli, Federico Feller Justification Logic as a foundation for certifying mobile computation. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robert Saxon Milnikel Conservativity for logics of justified belief: Two approaches. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Benjamin D. Miller Dichotomy theorems for countably infinite dimensional analytic hypergraphs. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jana Maríková O-minimal residue fields of o-minimal fields. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniele Mundici Finite axiomatizability in Łukasiewicz logic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gunter Fuchs lambda-structures and s-structures: Translating the models. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans Schoutens Classifying singularities up to analytic extensions of scalars is smooth. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Isabel Oitavem A recursion-theoretic approach to NP. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Teruyuki Yorioka A correction to "A non-implication between fragments of Martin's Axiom related to a property which comes from Aronszajn trees". Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yun Fan, Liang Yu Maximal pairs of c.e. reals in the computably Lipschitz degrees. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Longyun Ding Borel reducibility and finitely Hölder(α) embeddability. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Leszek Aleksander Kolodziejczyk Independence results for variants of sharply bounded induction. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gerhard Jäger, Dieter Probst The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Chuck Liang, Dale Miller A focused approach to combining logics. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen The provably total NP search problems of weak second order bounded arithmetic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1David M. Evans, Marco S. Ferreira The geometry of Hrushovski constructions, I: The uncollapsed case. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Toshiyasu Arai Quick cut-elimination for strictly positive cuts. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stefan Hetzl, Alexander Leitsch, Daniel Weller CERES in higher-order logic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Margaret E. M. Thomas An o-minimal structure without mild parameterization. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Emil Jerábek A sorting network in bounded arithmetic. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Uri Andrews New spectra of strongly minimal theories in finite languages. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kentaro Sato The strength of extensionality II - Weak weak set theories without infinity. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Antongiulio Fornasiero Dimensions, matroids, and dense pairs of first-order structures. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexei G. Myasnikov, Mahmood Sohrabi Groups elementarily equivalent to a free nilpotent group of finite rank. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Philip Scowcroft Some model-theoretic correspondences between dimension groups and AF algebras. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sergey Babenyshev, Vladimir V. Rybakov Unification in linear temporal logic LTL. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gunter Fuchs λ-structures and s-structures: Translating the iteration strategies. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1624 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.