Claus-Peter Wirth - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2017

Automation of Mathematical Induction as part of the History of LogicJ. Strother Moore, Claus-Peter Wirth. flap, 4(5), 2017. [doi]

A Simplified and Improved Free-variable Framework for Hilbert's epsilon as an Operator of Indefinite Committed ChoiceClaus-Peter Wirth. flap, 4(2), 2017. [doi]

Barry Hartley Slater (1936-2016): A Logical ObituaryClaus-Peter Wirth. flap, 4(2), 2017. [doi]

The Explicit Definition of Quantifiers via Hilbert's epsilon is Confluent and TerminatingClaus-Peter Wirth. flap, 4(2), 2017. [doi]

2016

A series of revisions of David Poole's specificityClaus-Peter Wirth, Frieder Stolzenburg. AMAI, 78(3-4):205-258, 2016. [doi]

2015

The RatioLog Project: Rational Extensions of Logical ReasoningUlrich Furbach, Claudia Schon, Frieder Stolzenburg, Karl-Heinz Weis, Claus-Peter Wirth. ki, 29(3):271-277, 2015. [doi]

Quantifiers in logic and proof-search using permissive-nominal terms and setsMurdoch James Gabbay, Claus-Peter Wirth. logcom, 25(2):473-523, 2015. [doi]

2014

David Poole's Specificity RevisedClaus-Peter Wirth, Frieder Stolzenburg. kr 2014: [doi]

2012

+, and Non-Permutability of β-StepsClaus-Peter Wirth. JSC, 47(9):1109-1135, 2012. [doi]

descente infinie - a manifestoClaus-Peter Wirth. igpl, 20(6):1046-1063, 2012. [doi]

HERBRAND's Fundamental Theorem in the Eyes of JEAN VAN HEIJENOORTClaus-Peter Wirth. lu, 6(3-4):485-520, 2012. [doi]

2009

Shallow confluence of conditional term rewriting systemsClaus-Peter Wirth. JSC, 44(1):60-98, 2009. [doi]

Jacques Herbrand: Life, Logic, and Automated DeductionClaus-Peter Wirth, Jörg H. Siekmann, Christoph Benzmüller, Serge Autexier. In Dov M. Gabbay, John Woods, editors, Logic from Russell to Church. Volume 5 of Handbook of the History of Logic, pages 195-254, Elsevier, 2009. [doi]

2008

Hilbert s epsilon as an operator of indefinite committed choiceClaus-Peter Wirth. japll, 6(3):287-317, 2008. [doi]

2005

A Generic Modular Data Structure for Proof Attempts Alternating on Ideas and GranularitySerge Autexier, Christoph Benzmüller, Dominik Dietrich, Andreas Meier, Claus-Peter Wirth. mkm 2005: 126-142 [doi]

History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!Claus-Peter Wirth. BIRTHDAY 2005: 192-203 [doi]

2004

Descente Infinie + DeductionClaus-Peter Wirth. igpl, 12(1):1-96, 2004. [doi]

2003

How to Prove Inductive Theorems? QUODLIBET!Jürgen Avenhaus, Ulrich Kühler, Tobias Schmidt-Samoa, Claus-Peter Wirth. cade 2003: 328-333 [doi]

2002

1999

Full First-Order Free Variable Sequents and Tableaux in Implicit InductionClaus-Peter Wirth. tableaux 1999: 293-307

1998

Full First-Order Sequent and Tableau Calculi with Preservation of Solutions and the Liberalized delta-Rule but without SkolemizationClaus-Peter Wirth. ftp 2000: 282-297 [doi]

1997

Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem ProvingUlrich Kühler, Claus-Peter Wirth. RTA 1997: 38-52

Positive negative conditional equations: a constructor-based framework for specification and inductive theorem provingClaus-Peter Wirth. PhD thesis, University of Kaiserslautern, 1997. [doi]

1996

Confluence of Terminating Conditional Rewrite Systems RevisitedBernhard Gramlich, Claus-Peter Wirth. RTA 1996: 245-259

1994

Abstract Notions and Inference Systems for Proofs by Mathematical InductionClaus-Peter Wirth, Klaus Becker. ctrs 1995: 353-373

On Notions of Inductive Validity for First-Oder Equational ClausesClaus-Peter Wirth, Bernhard Gramlich. cade 1994: 162-176

A Constructor-Based Approach to Positive/Negative-Conditional Equational SpecificationsClaus-Peter Wirth, Bernhard Gramlich. JSC, 17(1):51-90, 1994.

1992

A Constructor-Based Approach for Positive/Negative-Conditional Equational SpecificationsClaus-Peter Wirth, Bernhard Gramlich. ctrs 1993: 198-212

Sign in or sign up to see more results.

runs on WebDSL