default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Schroeder-Heister
Person information
- affiliation: University of Tübingen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j22]Thomas Piecha, Peter Schroeder-Heister:
General Proof Theory: Introduction. Stud Logica 107(1): 1-5 (2019)- [j21]Peter Schroeder-Heister
:
Kosta Došen (1954-2017). Stud Logica 107(1): 7-9 (2019) - [j20]Thomas Piecha, Peter Schroeder-Heister:
Incompleteness of Intuitionistic Propositional Logic with Respect to Proof-Theoretic Semantics. Stud Logica 107(1): 233-246 (2019) - 2017
- [j19]Peter Schroeder-Heister, Luca Tranchini:
Ekman's Paradox. Notre Dame J. Formal Log. 58(4): 567-581 (2017) - 2016
- [p2]Thomas Piecha, Peter Schroeder-Heister:
Advances in Proof-Theoretic Semantics: Introduction. Advances in Proof-Theoretic Semantics 2016: 1-4 - [p1]Peter Schroeder-Heister:
Open Problems in Proof-Theoretic Semantics. Advances in Proof-Theoretic Semantics 2016: 253-283 - [e5]Thomas Piecha, Peter Schroeder-Heister:
Advances in Proof-Theoretic Semantics. Trends in Logic 43, Springer 2016, ISBN 978-3-319-22685-9 [contents] - 2015
- [j18]Thomas Piecha, Wagner de Campos Sanz, Peter Schroeder-Heister:
Failure of Completeness in Proof-Theoretic Semantics. J. Philos. Log. 44(3): 321-335 (2015) - 2014
- [j17]Wagner de Campos Sanz, Thomas Piecha, Peter Schroeder-Heister:
Constructive semantics, admissibility of rules and the validity of Peirce's law. Log. J. IGPL 22(2): 297-308 (2014) - [j16]Grigory K. Olkhovikov, Peter Schroeder-Heister:
On Flattening Elimination Rules. Rev. Symb. Log. 7(1): 60-72 (2014) - [j15]Peter Schroeder-Heister:
The Calculus of Higher-Level Rules, Propositional Quantification, and the Foundational Approach to Proof-Theoretic Harmony. Stud Logica 102(6): 1185-1216 (2014) - 2013
- [j14]Peter Schroeder-Heister:
Definitional Reflection and Basic Logic. Ann. Pure Appl. Log. 164(4): 491-501 (2013) - 2012
- [j13]Peter Schroeder-Heister:
The categorical and the hypothetical: a critique of some fundamental assumptions of standard semantics. Synth. 187(3): 925-942 (2012) - 2011
- [j12]Peter Schroeder-Heister:
Implications-as-Rules vs. Implications-as-Links: An Alternative Implication-Left Schema for the Sequent Calculus. J. Philos. Log. 40(1): 95-101 (2011)
2000 – 2009
- 2007
- [j11]Peter Schroeder-Heister:
Generalized Definitional Reflection and the Inversion Principle. Logica Universalis 1(2): 355-376 (2007) - 2006
- [j10]Reinhard Kahle, Peter Schroeder-Heister:
Introduction: Proof-theoretic Semantics. Synth. 148(3): 503-506 (2006) - [j9]Peter Schroeder-Heister:
Validity Concepts in Proof-theoretic Semantics. Synth. 148(3): 525-571 (2006) - 2005
- [j8]Kai Frederick Wehmeier, Peter Schroeder-Heister:
Frege's permutation argument revisited. Synth. 147(1): 43-61 (2005) - 2002
- [j7]Peter Schroeder-Heister:
Resolution and the origins of structural reasoning: early proof-theoretic ideas of Hertz and Gentzen. Bull. Symb. Log. 8(2): 246-265 (2002) - 2001
- [e4]Reinhard Kahle, Peter Schroeder-Heister, Robert F. Stärk:
Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings. Lecture Notes in Computer Science 2183, Springer 2001, ISBN 3-540-42752-X [contents]
1990 – 1999
- 1996
- [e3]Roy Dyckhoff, Heinrich Herre, Peter Schroeder-Heister:
Extensions of Logic Programming, 5th International Workshop, ELP'96, Leipzig, Germany, March 28-30, 1996, Proceedings. Lecture Notes in Computer Science 1050, Springer 1996, ISBN 3-540-60983-0 [contents] - 1995
- [c5]Jörg Hudelmaier, Peter Schroeder-Heister:
Classical Lambek Logic. TABLEAUX 1995: 247-262 - 1993
- [c4]Peter Schroeder-Heister:
Definitional Reflection and the Completion. ELP 1993: 333-347 - [c3]Peter Schroeder-Heister:
Rules of Definitional Reflection. LICS 1993: 222-232 - 1992
- [e2]Lars-Henrik Eriksson, Lars Hallnäs, Peter Schroeder-Heister:
Extensions of Logic Programming, Second International Workshop, ELP'91, Stockholm, Sweden, January 27-29, 1991, Proceedings. Lecture Notes in Computer Science 596, Springer 1992, ISBN 3-540-55498-X [contents] - 1991
- [j6]Lars Hallnäs, Peter Schroeder-Heister:
A Proof-Theoretic Approach to Logic Programming. II. Programs as Definitions. J. Log. Comput. 1(5): 635-660 (1991) - [e1]Peter Schroeder-Heister:
Extensions of Logic Programming, International Workshop, Tübingen, FRG, December 8-10, 1989, Proceedings. Lecture Notes in Computer Science 475, Springer 1991, ISBN 3-540-53590-X [contents] - 1990
- [j5]Lars Hallnäs, Peter Schroeder-Heister:
A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules. J. Log. Comput. 1(2): 261-283 (1990) - [c2]Peter Schroeder-Heister:
Cut Elimination for Logics with Definitional Reflection. Nonclassical Logics and Information Processing 1990: 146-171
1980 – 1989
- 1989
- [c1]Peter Schroeder-Heister:
Hypothetical Reasoning and Definitional Reflection in Logic Programming. ELP 1989: 327-339 - 1988
- [j4]Kosta Dosen, Peter Schroeder-Heister:
Uniqueness, Definability and Interpolation. J. Symb. Log. 53(2): 554-570 (1988) - 1987
- [j3]Peter Schroeder-Heister:
A model-theoretic reconstruction of Frege's permutation argument. Notre Dame J. Formal Log. 28(1): 69-79 (1987) - 1984
- [j2]Peter Schroeder-Heister:
A Natural Extension of Natural Deduction. J. Symb. Log. 49(4): 1284-1300 (1984) - 1983
- [j1]Peter Schroeder-Heister:
The completeness of intuitionistic logic with respect to a validity concept based on an inversion principle. J. Philos. Log. 12(3): 359-377 (1983)
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-04-24 23:05 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:
