Simplified Axiom Schemes for Implication and Iterated Implication | Zendy

Jones John | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Simplified Axiom Schemes for Implication and Iterated Implication

Author(s) -

Jones John

Publication year - 1985

Publication title -

mathematical logic quarterly

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.473

H-Index - 28

eISSN - 1521-3870

pISSN - 0942-5616

DOI - 10.1002/malq.19850310103

Subject(s) - iterated function , citation , axiom , computer science , axiom of choice , mathematical economics , artificial intelligence , mathematics , library science , programming language , set theory , set (abstract data type) , mathematical analysis , geometry

Let C be the implicat.ion functor of EURASIEWICZ (see [ 2 ] ) and let IjPQ == (CP)iQ, IjPQ = T (CQ)iP ( j = 1 , 2 , . . .). Let 59 be the set of functors ( I I , (111 > 2) . We shall give here il complete formalisation of the m-valued propositional calculus with I designated truth-value in which tjhe primitive symbols are propositional variables and variable functors taking values from t'he set) 59. There has been given i n [ l ] a general method of fornialising such propositional calculi, but, we show here tha.t in t,liis particu1a.r case we may give a formalisation which has fewer and simpler axiom schemes. We shall also consider certain subsets of 9'. Some definitions will he t aken from [ 11 nithout coininent .

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research