Abstract
The concept of an absolutely realizable predicate formula is introduced. It can be regarded as a certain refinement of the concept of a constructively generally valid formula in predicate logic. It is proved that the class of all absolutely realizable formulas is a -complete set.Bibliography: 16 titles.
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
