Abstract
We solve the minimization problem for finitely axiomatizable theories in Godel infinite-valued propositional logic. That is, we obtain an algorithm that when input a formula α(X1,₀,Xn) outputs a formula β(X1,₀,Xm) such that (i) the theories singly axiomatized by {α} and {β} have isomorphic algebraic semantics, and (ii) if β′(X1,₀,Xm′) is any formula satisfying (i), then m′≥m.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
