No complete linear term rewriting system for propositional logic Anupam Das and Lutz Straßburger Abstract Recently it has been observed that the set of all sound linear inference rules in propositional

First Page		Document Content
Date: 2015-03-23 07:14:32 Mathematics Logic Mathematical logic Boolean algebra Formal languages Semantics Algebraic logic Logic in computer science Substitution Propositional calculus Rewriting Negation		No complete linear term rewriting system for propositional logic Anupam Das and Lutz Straßburger Abstract Recently it has been observed that the set of all sound linear inference rules in propositional Add to Reading List Source URL: www.lix.polytechnique.fr Download Document from Source Website File Size: 434,83 KB Share Document on Facebook

	HP 35s Scientific Calculator Get professional performance from the ultimate RPN scientific programmable calculator. Switch between RPN* and algebraic entry-system logic at any time. The HP 35s features DocID: 1uXjF - View Document
	Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, An Algebraic Approach to Dynamic Epistemic Logic Prakash Panangaden1 , Caitlin Phillips1 , Doina Precup1 , and Mehrnoosh Sadr DocID: 1tdJ8 - View Document
	Games in algebraic logic: axiomatisations and beyond Robin Hirsch and Ian Hodkinson Department of Computer Science, University College London, UK Department of Computing, Imperial College London, UK March 6, 2005 DocID: 1t7HB - View Document
	Efficient Reasoning with Range and Domain Constraints Dmitry Tsarkov and Ian Horrocks Department of Computer Science The University of Manchester Manchester, UK {tsarkov\|horrocks}@cs.man.ac.uk DocID: 1rnPM - View Document
	CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel DocID: 1rm3f - View Document