Search results for "Arnold Beckmann"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Arnold Beckmann, Benedikt Löwe	Computability in Europe 2008.	J. Log. Comput.	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	Arnold Beckmann, Wolfgang Merkle, Benedikt Löwe	Computability in Europe 2009.	Theory Comput. Syst.	2012	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Samuel R. Buss	Corrected upper bounds for free-cut elimination.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Benedikt Löwe	Computability in Europe 2008.	Theory Comput. Syst.	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	Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe	Computability in Europe 2008.	Arch. Math. Log.	2010	DBLP DOI BibTeX RDF
1	Arnold Beckmann	A Characterisation of Definable NP Search Problems in Peano Arithmetic.	WoLLIC	2009	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Edwin J. Beggs, Benedikt Löwe	From Gödel to Einstein: Computability between logic and physics at CiE 2006.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Martin Goldstern, Norbert Preining	Continuous Fraïssé Conjecture.	Order	2008	DBLP DOI BibTeX RDF	Better quasi order, Gödel logic, Wellquasiorder, Fraisse conjecture, Continuous embeddings
1	Arnold Beckmann, Benedikt Löwe	Computability in Europe 2006.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Faron Moller	On the Complexity of Parity Games.	BCS Int. Acad. Conf.	2008	DBLP BibTeX RDF
1	Klaus Aehlig, Arnold Beckmann	On the Computational Complexity of Cut-Reduction.	LICS	2008	DBLP DOI BibTeX RDF	cut-reduction, proof notations, propositional logic, Bounded Arithmetic
1	Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe (eds.)	Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings	CiE	2008	DBLP BibTeX RDF
1	Arnold Beckmann, Norbert Preining	Linear Kripke frames and Gödel logics.	J. Symb. Log.	2007	DBLP BibTeX RDF
1	Arnold Beckmann, Benedikt Löwe, Dag Normann	Logical Approaches to Computational Barriers: CiE 2006.	J. Log. Comput.	2007	DBLP DOI BibTeX RDF
1	Klaus Aehlig, Arnold Beckmann	On the computational complexity of cut-reduction	CoRR	2007	DBLP BibTeX RDF
1	Klaus Aehlig, Arnold Beckmann	Propositional Logic for Circuit Classes.	CSL	2007	DBLP DOI BibTeX RDF
1	Arnold Beckmann	Proofs, Programs and Abstract Complexity.	CSL	2007	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker (eds.)	Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings	CiE	2006	DBLP BibTeX RDF
1	Arnold Beckmann, Jan Johannsen	An unexpected separation result in Linearly Bounded Arithmetic.	Math. Log. Q.	2005	DBLP DOI BibTeX RDF
1	Arnold Beckmann	Uniform Proof Complexity.	J. Log. Comput.	2005	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Samuel R. Buss	Separation results for the size of constant-depth propositional proofs.	Ann. Pure Appl. Logic	2005	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Jeremy Avigad, Georg Moser	Preface.	Ann. Pure Appl. Logic	2005	DBLP DOI BibTeX RDF
1	Arnold Beckmann	Preservation theorems and restricted consistency statements in bounded arithmetic.	Ann. Pure Appl. Logic	2004	DBLP DOI BibTeX RDF
1	Arnold Beckmann	Height restricted constant depth LK	Electronic Colloquium on Computational Complexity (ECCC)	2003	DBLP BibTeX RDF
1	Arnold Beckmann, Chris Pollett, Samuel R. Buss	Ordinal notations and well-orderings in bounded arithmetic.	Ann. Pure Appl. Logic	2003	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Samuel R. Buss, Chris Pollett	Erratum to "Ordinal notations and well-orderings in bounded arithmetic" [Annals of Pure and Applied Logic 120 (2003) 197-223].	Ann. Pure Appl. Logic	2003	DBLP DOI BibTeX RDF
1	Arnold Beckmann	Dynamic ordinal analysis.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF
1	Arnold Beckmann	Notations for exponentiation.	Theor. Comput. Sci.	2002	DBLP DOI BibTeX RDF
1	Arnold Beckmann	Proving Consistency of Equational Theories in Bounded Arithmetic.	J. Symb. Log.	2002	DBLP BibTeX RDF
1	Arnold Beckmann	A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets.	Arch. Math. Log.	2002	DBLP DOI BibTeX RDF
1	Arnold Beckmann	A Note on Universal Measures for Weak Implicit Computational Complexity.	LPAR	2002	DBLP DOI BibTeX RDF	Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic
1	Arnold Beckmann	Resolution Refutations and Propositional Proofs with Height-Restrictions.	CSL	2002	DBLP DOI BibTeX RDF	Height of proofs, Length of proofs, Resolution refutation, Frege systems, Order induction principle, Cut introduction, MSC: Primary 03F20, Secondary 03F07, 68R99, Cut elimination, 68Q15, Bounded arithmetic, Propositional calculus
1	Arnold Beckmann	Exact Bounds for Lengths of Reductions in Typed lambda-Calculus.	J. Symb. Log.	2001	DBLP BibTeX RDF
1	Arnold Beckmann, Andreas Weiermann	Analyzing Gödel's T Via Expanded Head Reduction Trees.	Math. Log. Q.	2000	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Andreas Weiermann	Characterizing the elementary recursive functions by a fragment of Gödel's T.	Arch. Math. Log.	2000	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Wolfram Pohlers	Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory.	Ann. Pure Appl. Logic	1998	DBLP DOI BibTeX RDF
1	Arnold Beckmann, Andreas Weiermann	A term rewriting characterization of the polytime functions and related complexity classes.	Arch. Math. Log.	1996	DBLP DOI BibTeX RDF

Publications of "Arnold Beckmann" ( http://dblp.L3S.de/Authors/Arnold_Beckmann )