Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving-Reference-Cited by-同舟云学术

Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving

Published:2001 Issue: Volume: Page:201-216
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Baaz Matthias,Ciabattoni Agata,Fermüller Christian G.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45653-8_14

Reference26 articles.

1. A. Avron. Hypersequents, Logical Consequence and Intermediate Logics for Concurrency. Annals of Mathematics and Artificial Intelligence Vol. 4, 1991, 225–248.

2. A. Avron. The Method of Hypersequents in Proof Theory of Propositional Non-Classical Logics. In Logic: From Foundations to Applications. European Logic Colloquium, Keele, UK, July 20–29, 1993. Oxford, Clarendon Press, 1996, 1–32.

3. F. Baader, T. Nipkow. Term Rewriting and All That. Cambridge UP, 1998.

4. M. Baaz. Infinite-valued Gödel logics with 0-1-projections and relativizations. In Proceedings Gödel 96. Kurt Gödel’s Legacy. LNL 6, Springer, 23–33. 1996.

5. Lect Notes Comput Sci;M. Baaz,2000

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ten problems in Gödel logic;Soft Computing;2016-09-28

2. Herbrand Theorems for Substructural Logics;Logic for Programming, Artificial Intelligence, and Reasoning;2013

3. Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability;Logical Methods in Computer Science;2012-03-06

4. On the Satisfiability and Validity Problems in the Propositional Gödel Logic;Studies in Computational Intelligence;2012

5. CERES in Nonclassical Logics;Methods of Cut-Elimination;2010-12-10