ON A DECIDABLE FRAGMENT OF PREDICATE CALCULUS

First Page		Document Content
Date: 2008-11-05 20:24:12 Propositional calculus Proof theory Logical syntax First-order logic Monadic predicate calculus Decidability Well-formed formula Sequent calculus Proposition Logic Mathematical logic Predicate logic		ON A DECIDABLE FRAGMENT OF PREDICATE CALCULUS Add to Reading List Source URL: suppes-corpus.stanford.edu Download Document from Source Website File Size: 96,83 KB Share Document on Facebook

	Linear Logic, Heap-shape Patterns and Imperative Programming Extended Abstract Limin Jia David Walker DocID: 11Ix4 - View Document
	Appendix: Chapter 6, §7, second printing 7 Tableaux for monadic predicate logic In this section, we extend the semantic tableau test for validity in sentential logic (see §5 of Chapter Three) to monadic predicate logi DocID: SwDJ - View Document
	Journal of Automated Reasoning, 18, 297{[removed]) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Computing Circumscription Revisited: A Reduction Algorithm DocID: Nd9P - View Document
	Computing Circumscription Revisited: A Reduction Algorithm Patrick Doherty and Witold. L ukaszewicz and Andrzej Szalas Abstract DocID: N7ez - View Document
	International Journal of Foundations of Computer Science Vol. 19, No. i[removed] DocID: 62Su - View Document