Abstract
A predicate language over a propositional language S is a couple qS = (S,q) where q is the signature of qS, i.e. the function which divides descriptive terms D(q) of qS into syntactical categories. All predicate languages involve the sets V f and V b of free and bound individual variables, resp., connectives of S, and quantifiers ∀ ∃. The notions of a term, formula, and sentence of qS are defined in the usual way. A predicate language qS 0 over the propositional language S 0 = (S 0, →, Λ, V, ¬) is called basic.
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
