default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Leitsch
Person information
- affiliation: TU Wien, Vienna, Autria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Alexander Leitsch, Anela Lolic, Stella Mahler:
On Proof Schemata and Primitive Recursive Arithmetic. LPAR Complementary Volume 2024: 117-130- [c32]Alexander Leitsch, Anela Lolic:
Herbrand's Theorem in Inductive Proofs. LPAR 2024: 295-310 - 2021
- [j28]David M. Cerna
, Alexander Leitsch, Anela Lolic:
Schematic Refutations of Formula Schemata. J. Autom. Reason. 65(5): 599-645 (2021) - 2020
- [j27]Matthias Baaz, Alexander Leitsch, Anela Lolic:
An abstract form of the first epsilon theorem. J. Log. Comput. 30(8): 1447-1468 (2020) - [c31]David M. Cerna, Alexander Leitsch, Anela Lolic:
On the Unification of Term Schemata. UNIF 2020: 6:1-6:6
2010 – 2019
- 2019
- [j26]Alexander Leitsch, Anela Lolic:
Extraction of Expansion Trees. J. Autom. Reason. 62(3): 393-430 (2019) - [j25]Gabriel Ebner, Stefan Hetzl, Alexander Leitsch, Giselle Reis, Daniel Weller:
On the Generation of Quantified Lemmas. J. Autom. Reason. 63(1): 95-126 (2019) - [i7]David M. Cerna, Alexander Leitsch, Anela Lolic:
Schematic Refutations of Formula Schemata. CoRR abs/1902.08055 (2019) - 2018
- [j24]Alexander Leitsch, Michael Peter Lettmann:
The problem of Π2-cut-introduction. Theor. Comput. Sci. 706: 83-116 (2018) - [c30]Matthias Baaz, Alexander Leitsch, Anela Lolic:
A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem. LFCS 2018: 55-71 - 2017
- [j23]David M. Cerna, Alexander Leitsch, Giselle Reis, Simon Wolfsteiner:
Ceres in intuitionistic logic. Ann. Pure Appl. Log. 168(10): 1783-1836 (2017) - [j22]Matthias Baaz, Alexander Leitsch:
On the Complexity of Translations from Classical to Intuitionistic Proofs. FLAP 4(4) (2017) - [j21]Alexander Leitsch, Nicolas Peltier, Daniel Weller:
CERES for first-order schemata. J. Log. Comput. 27(7): 1897-1954 (2017) - 2016
- [c29]David M. Cerna, Alexander Leitsch:
Schematic Cut Elimination and the Ordered Pigeonhole Principle. IJCAR 2016: 241-256 - [i6]David M. Cerna, Alexander Leitsch:
Schematic Cut elimination and the Ordered Pigeonhole Principle [Extended Version]. CoRR abs/1601.06548 (2016) - [i5]Alexander Leitsch, Michael Peter Lettmann:
The problem of Pi_2-cut-introduction. CoRR abs/1611.08208 (2016) - 2015
- [c28]Matthias Baaz, Alexander Leitsch, Giselle Reis:
A Note on the Complexity of Classical and Intuitionistic Proofs. LICS 2015: 657-666 - [i4]David M. Cerna, Alexander Leitsch:
Analysis of Clause set Schema Aided by Automated Theorem Proving: A Case Study [Extended Paper]. CoRR abs/1503.08551 (2015) - 2014
- [j20]Matthias Baaz, Alexander Leitsch:
Cut-Elimination: Syntax and Semantics. Stud Logica 102(6): 1217-1244 (2014) - [j19]Stefan Hetzl, Alexander Leitsch, Giselle Reis, Daniel Weller:
Algorithmic introduction of quantified cuts. Theor. Comput. Sci. 549: 1-16 (2014) - [c27]Stefan Hetzl, Alexander Leitsch, Giselle Reis, Janos Tapolczai, Daniel Weller:
Introducing Quantified Cuts in Logic with Equality. IJCAR 2014: 240-254 - [i3]Stefan Hetzl, Alexander Leitsch, Giselle Reis, Daniel Weller:
Algorithmic Introduction of Quantified Cuts. CoRR abs/1401.4330 (2014) - [i2]Stefan Hetzl, Alexander Leitsch, Giselle Reis, Janos Tapolczai, Daniel Weller:
Introducing Quantified Cuts in Logic with Equality. CoRR abs/1402.2474 (2014) - 2013
- [c26]Cvetan Dunchev, Alexander Leitsch, Mikheil Rukhaia, Daniel Weller:
Cut-Elimination and Proof Schemata. TbiLLC 2013: 117-136 - [i1]Cvetan Dunchev, Alexander Leitsch, Mikheil Rukhaia, Daniel Weller:
CERES for First-Order Schemata. CoRR abs/1303.4257 (2013) - 2012
- [c25]Alexander Leitsch, Tomer Libal:
A Resolution Calculus for Second-order Logic with Eager Unification. PAAR@IJCAR 2012: 95 - [c24]Alexander Leitsch, Giselle Reis, Bruno Woltzenlogel Paleo:
Towards CERes in intuitionistic logic. CSL 2012: 485-499 - [c23]Stefan Hetzl, Alexander Leitsch, Daniel Weller:
Towards Algorithmic Cut-Introduction. LPAR 2012: 228-242 - [c22]Cvetan Dunchev, Alexander Leitsch, Tomer Libal, Martin Riener, Mikheil Rukhaia, Daniel Weller, Bruno Woltzenlogel Paleo:
System Feature Description: Importing Refutations into the GAPT Framework. PxTP 2012: 51-57 - [c21]Cvetan Dunchev, Alexander Leitsch, Tomer Libal, Martin Riener, Mikheil Rukhaia, Daniel Weller, Bruno Woltzenlogel Paleo:
PROOFTOOL: a GUI for the GAPT Framework. UITP 2012: 1-14 - 2011
- [j18]Stefan Hetzl, Alexander Leitsch, Daniel Weller:
CERES in higher-order logic. Ann. Pure Appl. Log. 162(12): 1001-1034 (2011) - 2010
- [c20]Tsvetan Dunchev, Alexander Leitsch, Tomer Libal, Daniel Weller, Bruno Woltzenlogel Paleo:
System Description: The Proof Transformation System CERES. IJCAR 2010: 427-433
2000 – 2009
- 2009
- [c19]Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo:
A Clausal Approach to Proof Analysis in Second-Order Logic. LFCS 2009: 214-229 - 2008
- [j17]Alexander Leitsch, Günter Schachner, Karl Svozil:
How to Acknowledge Hypercomputation? Complex Syst. 18(1) (2008) - [j16]Agata Ciabattoni, Alexander Leitsch:
Towards an algorithmic construction of cut-elimination procedures. Math. Struct. Comput. Sci. 18(1): 81-105 (2008) - [j15]Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr:
CERES: An analysis of Fürstenberg's proof of the infinity of primes. Theor. Comput. Sci. 403(2-3): 160-175 (2008) - [c18]Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo:
Herbrand Sequent Extraction. AISC/MKM/Calculemus 2008: 462-477 - [c17]Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo:
Transforming and Analyzing Proofs in the CERES-System. LPAR Workshops 2008 - 2006
- [j14]Matteo Cavaliere, Rudolf Freund, Alexander Leitsch, Gheorghe Paun:
Event-Related Outputs of Computations in P Systems. J. Autom. Lang. Comb. 11(3): 263-278 (2006) - [j13]Matthias Baaz, Alexander Leitsch:
Towards a clausal analysis of cut-elimination. J. Symb. Comput. 41(3-4): 381-410 (2006) - [c16]Stefan Hetzl, Alexander Leitsch:
Proof Transformations and Structural Invariance. Algebraic and Proof-theoretic Aspects of Non-classical Logics 2006: 201-230 - [c15]Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr:
Proof Transformation by CERES. MKM 2006: 82-93 - 2004
- [c14]Matthias Baaz, Alexander Leitsch:
CERES in Many-Valued Logics. LPAR 2004: 1-20 - [c13]Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr:
Cut-Elimination: Experiments with CERES. LPAR 2004: 481-495 - 2001
- [c12]Matthias Baaz, Alexander Leitsch:
Comparing the Complexity of Cut-Elimination Methods. Proof Theory in Computer Science 2001: 49-67 - [p2]Matthias Baaz, Uwe Egly, Alexander Leitsch:
Normal Form Transformations. Handbook of Automated Reasoning 2001: 273-333 - [p1]Christian G. Fermüller, Alexander Leitsch, Ullrich Hustadt, Tanel Tammet:
Resolution Decision Procedures. Handbook of Automated Reasoning 2001: 1791-1849 - [e3]Rajeev Goré, Alexander Leitsch, Tobias Nipkow:
Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings. Lecture Notes in Computer Science 2083, Springer 2001, ISBN 3-540-42254-4 [contents] - 2000
- [j12]Matthias Baaz, Alexander Leitsch:
Cut-elimination and Redundancy-elimination by Resolution. J. Symb. Comput. 29(2): 149-177 (2000)
1990 – 1999
- 1999
- [j11]Matthias Baaz, Alexander Leitsch:
Cut Normal Forms and Proof Complexity. Ann. Pure Appl. Log. 97(1-3): 127-177 (1999) - [c11]Matthias Baaz, Alexander Leitsch, Georg Moser:
System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216 - 1998
- [j10]Christian G. Fermüller, Alexander Leitsch:
Decision Procedures and Model Building in Equational Clause Logic. Log. J. IGPL 6(1): 17-41 (1998) - [c10]Alexander Leitsch:
Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction. FTP (LNCS Selection) 1998: 62-79 - 1997
- [b2]Alexander Leitsch:
The Resolution Calculus. Texts in Theoretical Computer Science. An EATCS Series, Springer 1997, ISBN 978-3-540-61882-9, pp. I-VIII, 1-300 - [e2]Georg Gottlob, Alexander Leitsch, Daniele Mundici:
Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings. Lecture Notes in Computer Science 1289, Springer 1997, ISBN 3-540-63385-5 [contents] - 1996
- [j9]Christian G. Fermüller, Alexander Leitsch:
Hyperresolution and Automated Model Building. J. Log. Comput. 6(2): 173-203 (1996) - [j8]Matthias Baaz, Alexander Leitsch, Richard Zach:
Completeness of a First-Order Temporal Logic with Time-Gaps. Theor. Comput. Sci. 160(1&2): 241-270 (1996) - [c9]Matthias Baaz, Alexander Leitsch:
Fast Cut-Elimination by Projection. CSL 1996: 18-33 - 1995
- [c8]Matthias Baaz, Alexander Leitsch, Richard Zach:
Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. CSL 1995: 1-15 - 1994
- [j7]Matthias Baaz, Alexander Leitsch:
On Skolemization and Proof Complexity. Fundam. Informaticae 20(4): 353-379 (1994) - [c7]Matthias Baaz, Christian G. Fermüller, Alexander Leitsch:
A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation. LICS 1994: 213-219 - 1993
- [b1]Christian G. Fermüller, Alexander Leitsch, Tanel Tammet, N. K. Zamov:
Resolution Methods for the Decision Problem. Lecture Notes in Computer Science 679, Springer 1993, ISBN 3-540-56732-1 - [j6]Alexander Leitsch:
Deciding Clause Classes by Semantic Clash Resolution. Fundam. Informaticae 18: 163-182 (1993) - [e1]Georg Gottlob, Alexander Leitsch, Daniele Mundici:
Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, Proceedings. Lecture Notes in Computer Science 713, Springer 1993, ISBN 3-540-57184-1 [contents] - 1992
- [j5]Matthias Baaz, Alexander Leitsch:
Complexity of Resolution Proofs and Function Introduction. Ann. Pure Appl. Log. 57(3): 181-215 (1992) - [c6]Christian G. Fermüller, Alexander Leitsch:
Model Building by Resolution. CSL 1992: 134-148 - 1990
- [c5]Matthias Baaz, Alexander Leitsch:
A Strong Problem Reduction Method Based on Function Introduction. ISSAC 1990: 30-37
1980 – 1989
- 1989
- [j4]Alexander Leitsch:
On Different Concepts of Resolution. Math. Log. Q. 35(1): 71-77 (1989) - [c4]Alexander Leitsch:
Deciding Horn Classes by Hyperresolution. CSL 1989: 225-241 - 1987
- [c3]Matthias Baaz, Alexander Leitsch:
Strong splitting rules in automated theorem proving. EUROCAL 1987: 424-425 - 1985
- [j3]Georg Gottlob, Alexander Leitsch:
On the Efficiency of Subsumption Algorithms. J. ACM 32(2): 280-295 (1985) - [c2]Georg Gottlob, Alexander Leitsch:
Fast Subsumption Algorithms. European Conference on Computer Algebra (2) 1985: 64-77 - [c1]Matthias Baaz, Alexander Leitsch:
Eine Methode zur automatischen Problemreduktion. ÖGAI 1985: 154-163 - 1982
- [j2]Alexander Leitsch:
Fiducial intervals for the waiting time in batch and time-sharing systems. Computing 28(4): 289-303 (1982) - 1980
- [j1]Alexander Leitsch:
Complexity of index sets and translating functions. Fundam. Informaticae 3(2): 181-188 (1980)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST 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:
