Search results for "Ann. Pure Appl. Logic"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Liang Yu	Characterizing strong randomness via Martin-Löf randomness.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Andrej Bauer, Davorin Lesnik	Metric spaces in synthetic topology.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	George Barmpalias	Tracing and domination in the Turing degrees.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Steven Vickers	Cosheaves and connectedness in formal topology.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Timothy J. Carlson, Gunnar Wilken	Tracking chains of Σ2-elementarity.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Peter Dybjer, Denis Kuperberg	Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Silvio Valentini	Independence results in formal topology.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe	Computability in Europe 2009.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Paul Shafer	Coding true arithmetic in the Medvedev degrees of Π10 classes.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Hajime Ishihara	Two subcategories of apartness spaces.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Francesco Ciraulo	A constructive investigation of satisfiability.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	David Diamondstone	Low upper bounds in the LR degrees.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Albert Ziegler	Generalizing realizability and Heyting models for constructive set theory.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Douglas S. Bridges	Reflections on function spaces.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Ioannis Souldatos	Linear orderings and powers of characterizable cardinals.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Agata Ciabattoni, Nikolaos Galatos, Kazushige Terui	Algebraic proof theory for substructural logics: Cut-elimination and completions.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Laurent Bienvenu, Joseph S. Miller	Randomness and lowness notions via open covers.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Vera Koponen	Asymptotic probabilities of extension properties and random l-colourable structures.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	David Diamondstone, Bjørn Kjos-Hanssen	Martin-Löf randomness and Galton-Watson processes.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Claudio Sacerdoti Coen, Enrico Zoli	Lebesgue's dominated convergence theorem in Bishop's style.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Hristo Ganchev, Mariya Ivanova Soskova	The high/low hierarchy in the local structure of the omega-enumeration degrees.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	P. E. Alaev	Computably categorical Boolean algebras enriched by ideals and atoms.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Willem Conradie, Alessandra Palmigiano	Algorithmic correspondence and canonicity for distributive modal logic.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Cameron E. Freer, Daniel M. Roy	Computable de Finetti measures.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Melvin Fitting	Prefixed tableaus and nested sequents.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Michele Pagani	Visible acyclic differential nets, Part I: Semantics.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi	Empty intervals in the enumeration degrees.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Pierre Matet, Toshimichi Usuba	Two-cardinal versions of weak compactness: Partitions of pairs.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Andrej Bauer, Thierry Coquand, Giovanni Sambin, Peter M. Schuster	Preface.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Pavel Pudlák, Neil Thapen	Alternating minima and maxima, Nash equilibria and Bounded Arithmetic.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	David Fernández Duque	Tangled modal logic for topological dynamics.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Pietro Galliani	Inclusion and exclusion dependencies in team semantics - On some logics of imperfect information.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	D. Normann, Vladimir Yu. Sazonov	The extensional ordering of the sequential functionals.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Marc Bezem, Clemens Grabmayer, Michal Walicki	Expressive power of digraph solvability.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Alla Sirokofskich	Decidability questions for a ring of Laurent polynomials.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Giorgi Japaridze	Separating the basic logics of the basic recurrences.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Norihiro Kamide	Bounded linear-time temporal logic: A proof-theoretic investigation.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Dilip Raghavan, Stevo Todorcevic	Cofinal types of ultrafilters.	Ann. Pure Appl. Logic	2012	DBLP DOI BibTeX RDF
1	Benjamin D. Miller	Dichotomy theorems for countably infinite dimensional analytic hypergraphs.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Jana Maríková	O-minimal residue fields of o-minimal fields.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Daniele Mundici	Finite axiomatizability in Łukasiewicz logic.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Gunter Fuchs	lambda-structures and s-structures: Translating the models.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Hans Schoutens	Classifying singularities up to analytic extensions of scalars is smooth.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Isabel Oitavem	A recursion-theoretic approach to NP.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Teruyuki Yorioka	A correction to "A non-implication between fragments of Martin's Axiom related to a property which comes from Aronszajn trees".	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Yun Fan, Liang Yu	Maximal pairs of c.e. reals in the computably Lipschitz degrees.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Longyun Ding	Borel reducibility and finitely Hölder(α) embeddability.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Leszek Aleksander Kolodziejczyk	Independence results for variants of sharply bounded induction.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Gerhard Jäger, Dieter Probst	The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Chuck Liang, Dale Miller	A focused approach to combining logics.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen	The provably total NP search problems of weak second order bounded arithmetic.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	David M. Evans, Marco S. Ferreira	The geometry of Hrushovski constructions, I: The uncollapsed case.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Toshiyasu Arai	Quick cut-elimination for strictly positive cuts.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Stefan Hetzl, Alexander Leitsch, Daniel Weller	CERES in higher-order logic.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Margaret E. M. Thomas	An o-minimal structure without mild parameterization.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Emil Jerábek	A sorting network in bounded arithmetic.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Uri Andrews	New spectra of strongly minimal theories in finite languages.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Kentaro Sato	The strength of extensionality II - Weak weak set theories without infinity.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Antongiulio Fornasiero	Dimensions, matroids, and dense pairs of first-order structures.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Alexei G. Myasnikov, Mahmood Sohrabi	Groups elementarily equivalent to a free nilpotent group of finite rank.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Philip Scowcroft	Some model-theoretic correspondences between dimension groups and AF algebras.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Sergey Babenyshev, Vladimir V. Rybakov	Unification in linear temporal logic LTL.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Gunter Fuchs	λ-structures and s-structures: Translating the iteration strategies.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Yimu Yin	Integration in algebraically closed valued fields.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Vera Fischer, Sy-David Friedman, Lyubomyr Zdomskyy	Projective wellorders and mad families with large continuum.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Peter Koepke, Philip D. Welch	Global square and mutual stationarity at the alephn.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Byunghan Kim, Hyeung-Joon Kim	Notions around tree property 1.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Antonín Kucera, André Nies	Demuth randomness and computational complexity.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	I. Sharpe, P. D. Welch	Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Joan Bagaria, Yiannis N. Moschovakis, Margarita Otero, Ivan N. Soskov	Preface.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Michael J. Lieberman	Category-theoretic aspects of abstract elementary classes.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel	Σ01 and Π01 equivalence structures.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Dieter Probst	The provably terminating operations of the subsystem PETJ of explicit mathematics.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	George Barmpalias, André Nies	Upper bounds on ideals in the computably enumerable Turing degrees.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Predrag Tanovic	Minimal first-order structures.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Norihiro Kamide, Heinrich Wansing	Completeness and cut-elimination theorems for trilattice logics.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Barbara F. Csima, Reed Solomon	The complexity of central series in nilpotent computable groups.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Emil Jerábek	On theories of bounded arithmetic for NC1.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Sara Miner More, Pavel Naumov	Logic of secrets in collaboration networks.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Assaf Rinot	On guessing generalized clubs at the successors of regulars.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Olivia Caramello	A characterization theorem for geometric logic.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Athanassios Tzouvaras	A combinatorial result related to the consistency of New Foundations.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Alf Onshuus, Alexander Usvyatsov	Stable domination and weight.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Paola D'Aquino, Angus Macintyre	Quadratic forms in models of IΔ0+Ω1, Part II: Local equivalence.	Ann. Pure Appl. Logic	2011	DBLP DOI BibTeX RDF
1	Klaus Aehlig, Arnold Beckmann	On the computational complexity of cut-reduction.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov, Yuri Matiyasevich, Grigori Mints, Anatol Slissenko	Preface.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Walid Belkhir, Luigi Santocanale	The variable hierarchy for the games µ-calculus.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Lev D. Beklemishev	Kripke semantics for provability logic GLP.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Mircea-Dan Hernest, Trifon Trifonov	Light Dialectica revisited.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu	Higher Kurtz randomness.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Todd Eisworth	Club-guessing, stationary reflection, and coloring theorems.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Robin Adams, Zhaohui Luo	Classical predicative logic-enriched type theories.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Gunter Fuchs	Generic embeddings associated to an indestructibly weakly compact cardinal.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Toshiyasu Arai	Wellfoundedness proofs by means of non-monotonic inductive definitions II: First order operators.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Wang Wei	Martin's Axiom and embeddings of upper semi-lattices into the Turing degrees.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Bas Spitters	Locatedness and overt sublocales.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Dominic Hughes	A minimal classical sequent calculus free of structural rules.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	N. 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).	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	J. D. Mitchell, M. Morayne, Y. Péresse, M. Quick	Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF
1	Grigori Mints	Cut-free formulations for a quantified logic of here and there.	Ann. Pure Appl. Logic	2010	DBLP DOI BibTeX RDF

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