Opening book details…
Can I read Computing Minimal Axiomatizations in Godel Propositional Logic on EtoBox?
Computing Minimal Axiomatizations in Godel Propositional Logic by S. Aguzzoli; O. M. D'Antona; V. Marra is a Computer Science article available to read on EtoBox.
What is Computing Minimal Axiomatizations in Godel Propositional Logic about?
We solve the minimization problem for finitely axiomatizable theories in Gödel infinite-valued propositional logic. That is, we obtain an algorithm that when input a formula α(X 1 ,...,X n ) outputs a formula β(X 1 ,...,X m ) such that (i) the theories singly axiomatized by {α} and {β} have isomorphic algebraic semantics, and (ii) if β (X 1 ,...,X m ) is any formula satisfying (i), then m ≥ m.
Who reads Computing Minimal Axiomatizations in Godel Propositional Logic?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- S. Aguzzoli; O. M. D'Antona; V. Marra
- Publisher
- Oxford University Press; Oxford University Press (OUP) (ISSN 0955-792X)
- Published
- 2009
- Language
- EN
- Field
- Computer Science (Physical Sciences)