Sciweavers

15 search results - page 2 / 3
» Herbrand Sequent Extraction
Sort
View
ISMVL
1993
IEEE
140views Hardware» more  ISMVL 1993»
13 years 9 months ago
Systematic Construction of Natural Deduction Systems for Many-Valued Logics
A construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent...
Matthias Baaz, Christian G. Fermüller, Richar...
LOGCOM
1998
110views more  LOGCOM 1998»
13 years 5 months ago
leanTAP Revisited
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
Melvin Fitting
TABLEAUX
2009
Springer
13 years 9 months ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu
APAL
2010
98views more  APAL 2010»
13 years 5 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes
ENTCS
2006
117views more  ENTCS 2006»
13 years 5 months ago
Interpreting SWRL Rules in RDF Graphs
An unresolved issue in SWRL (the Semantic Web Rule Language) is whether the intended semantics of its RDF representation can be described as an extension of the W3C RDF semantics....
Jing Mei, Harold Boley