[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-seo-570887-105":3,"detail-sidebar-cat-0-en-105":81,"doc-detail-570887-en":130},{"code":4,"msg":5,"data":6},0,"ok",{"site_id":7,"language":8,"slug":9,"title":10,"keywords":11,"description":12,"schema_data":13,"social_meta":74,"head_meta":76,"extra_data":78,"updated_unix":80},105,"en","some-theorems-in-logic","Some Theorems in Logic","","A featured article by R. J. Parikh explains how logic develops through symbolisation and formalisation, contrasting informal axiomatic reasoning with formal axiomatic systems. It outlines a formal treatment of additive groups using precise syntax: terms, atomic formulas, compound formulas, and quantifiers. The piece defines logical and mathematical axioms, introduces rules of inference and proofs as finite sequences, and describes why theoremhood cannot generally be mechanically decided. It then connects formulas to models via interpretations and truth conditions.",{"@graph":14,"@context":73},[15,34,56],{"@type":16,"itemListElement":17},"BreadcrumbList",[18,23,27,31],{"item":19,"name":20,"@type":21,"position":22},"https://docshare.wps.com","Home","ListItem",1,{"item":24,"name":25,"@type":21,"position":26},"https://docshare.wps.com/document/","Document",2,{"item":28,"name":29,"@type":21,"position":30},"https://docshare.wps.com/document/research-report/","Research & Report",3,{"item":32,"name":10,"@type":21,"position":33},"https://docshare.wps.com/document/some-theorems-in-logic/570887/",4,{"url":32,"name":10,"@type":35,"image":36,"author":41,"headline":10,"publisher":44,"fileFormat":47,"inLanguage":8,"description":12,"dateModified":48,"datePublished":49,"encodingFormat":47,"isAccessibleForFree":50,"interactionStatistic":51},"DigitalDocument",{"url":37,"@type":38,"width":39,"height":40},"https://docshare.wps.com/thumbnails/some-theorems-in-logic/570887.png","ImageObject",300,407,{"name":42,"@type":43},"Maya Linwood","Person",{"url":19,"name":45,"@type":46},"DocShare","Organization","application/pdf","2026-11-16","2026-10-13",true,{"@type":52,"interactionType":53,"userInteractionCount":55},"InteractionCounter",{"@type":54},"ViewAction",9,{"@type":57,"mainEntity":58},"FAQPage",[59,65,69],{"name":60,"@type":61,"acceptedAnswer":62},"What shift in logic does Parikh emphasize in the article?","Question",{"text":63,"@type":64},"Parikh highlights the increasing tendency toward symbolisation and formalisation in logic, which matured with figures such as Russell, Hilbert, and Church.","Answer",{"name":66,"@type":61,"acceptedAnswer":67},"How does the article define terms and (atomic) formulas?",{"text":68,"@type":64},"It defines variables/constants as terms, builds compound terms using addition and negation, and treats equality between two terms as an atomic formula.",{"name":70,"@type":61,"acceptedAnswer":71},"What is a model in the sense used here, and how are formulas evaluated?",{"text":72,"@type":64},"A model consists of a nonempty set with distinguished element, function symbols for operations, and an interpretation map from symbols to elements. Truth of formulas is then defined recursively using the induced interpretation of terms.","https://schema.org",{"og:url":32,"og:type":75,"og:title":10,"og:site_name":45,"og:description":12},"article",{"robots":77,"canonical":32},"index,follow",{"doc_id":79,"site_id":7},570887,1792230603,{"code":4,"msg":82,"data":83},"success",[84,88,92,96,101,106,111,115,119,122,126],{"id":22,"doc_module":4,"doc_module_name":25,"category_name":85,"show_sort_weight":86,"slug":87},"Story & Novel",90,"story-novel",{"id":26,"doc_module":4,"doc_module_name":25,"category_name":89,"show_sort_weight":90,"slug":91},"Literature",80,"literature",{"id":33,"doc_module":4,"doc_module_name":25,"category_name":93,"show_sort_weight":94,"slug":95},"Exam",70,"exam",{"id":97,"doc_module":4,"doc_module_name":25,"category_name":98,"show_sort_weight":99,"slug":100},5,"Comic",60,"comic",{"id":102,"doc_module":4,"doc_module_name":25,"category_name":103,"show_sort_weight":104,"slug":105},6,"Technology",50,"technology",{"id":107,"doc_module":4,"doc_module_name":25,"category_name":108,"show_sort_weight":109,"slug":110},7,"Healthcare",40,"healthcare",{"id":112,"doc_module":4,"doc_module_name":25,"category_name":29,"show_sort_weight":113,"slug":114},8,30,"research-report",{"id":55,"doc_module":4,"doc_module_name":25,"category_name":116,"show_sort_weight":117,"slug":118},"Religion & Spirituality",20,"religion-spirituality",{"id":117,"doc_module":4,"doc_module_name":25,"category_name":120,"show_sort_weight":117,"slug":121},"World Cup","world-cup",{"id":123,"doc_module":4,"doc_module_name":25,"category_name":124,"show_sort_weight":123,"slug":125},10,"Lifestyle","lifestyle",{"id":127,"doc_module":4,"doc_module_name":25,"category_name":128,"show_sort_weight":97,"slug":129},19,"General","general",{"code":4,"msg":82,"data":131},{"doc_id":79,"user_id":132,"nickname":42,"user_avatar":133,"doc_module":4,"category_id":112,"category_name":29,"doc_title":10,"doc_description":12,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":55,"is_deleted":4,"is_public":22,"is_downloadable":22,"audit_status":22,"page_count":139,"language":140,"language_code":8,"site_id":7,"html_lang":8,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":12,"update_tm":144,"read_time":145,"preview_page_count":146,"preview_urls":147},962084928432,"https://ap-avatar.wpscdn.com/davatar_155a257f0dc6eb9ab79c44ca47cae57d","THE  \nMATHEMATICSSTUDENT  \nEDITED BY  \nM.VENKATARAMAN and T.P.SRINIVASAN  \nwith the co-operation of  \nJ.N.KAPUR,P.K.MENON,RAM BEHARI,S.S.SHRIKHANDE,V.S.VARADARAJAN,  \nK.VENKATACHALIENGAR,R.VENKATARAMAN.  \nVoLUME XXXIV,NUMBBRS 3&4JULY—DEC.1966  \n(Issued Jan.1968)  \nPUBLISHBD BYTHE INDIAN MATHEMATICAL SOCIETY  \nCONTENTS  \nR.J.PARIKH:Some Theorems in Logic…  125S.K.SINGH:Exceptional Values of Entire andMeromorphic Functions131V.N.KULKARNI:Maximum Term and the Rank ofan Entire Function…137V.SREENIVASULU:The Maximum Term of an EntireFunction141SHANKAR HARI DWIVEDI :Proximate Orders147  \nG.DAS:Discontinuous Riesz Means153R.SRIDHARAN:Filtered Algebras163KRISHNA TEWARI:Complexes over an Algebra165S.K.JAIN:Rings with Constraints175  \nH.SUBRAMANIAN:The Structure Space of a Ring179INDRANAND SINHA:On The Radical of Subrings ofRings…  185T.E.S.RAGHAVAN:Theory of Games in Relation toPositive Operators…191T.PARTHASARATHY:On General Minimax Theorem…195R.BALAKRISHNAN:On The Apollonian Hyperbolas ofa Pencil of Conics…199R.BALAKRISHNAN:On the Algebra of Magic Matrices.…201  \nJ.KRISHNA RAO:Some Null Radiation Fields inGeneral Relativity…207R.LALITHA:Contributions to the Study ofCertain,Spaces of Entire Functionsand of entire functions with Conffi-cients in a Banach Space…211BooK REVIEWS:.…215  \nSOME THEOREMS IN LOGIC  \nBy  \nR.J.PARIKH*  \nIf one looks at the development of Logic during the past century,one sees that this development is strongly affected by two factors.Oneis the wide dismay and alarm caused by the discovery,by Russell,Burali-Forti and Cantor himself,of contradictions in Cantor's theory of sets.The other is the increasing tendency in logic towards symbolisation andformalisation,which began with Peano,Frege,Boole,and attainedmaturity with Russell,Hilbert and Church.It is about the latter thatI shall talk.  \nWe are all familiar with the axiomatic method in Mathematics.Axioms regarding certain mathematical objects are given and the conse-quences are called theorems.Normally,the consequences are derivedinformally and the underlying logic is intuitive.Such a system will be aninformal axiomatic system.If,however,the underlying logic is also madeexplicit and formalised,we have a formal axiomatic system.Once amathematical theory is formalised,it then becomes a precisely definedmathematical object capable of treatment by mathematical methods,yielding,at times,very surprising results.  \nLet us see what a formal axiomatic theory for additive groups willlook like.  \nSYMBOLS:—  \n(i)Variables to range over the elements of the group:x,y,z,u,v,w,X1,y1,Z1.………(ii)constants:0  \n(iii)function symbols:+and --(iv)equality:=  \n(v)logical connectives:&(and),V(or),～(not)→(implies),⇔(iff)(vi)brackets:(,).  \n*Half-hour address delivered at the Dharwar conference(1964).  \nDef.1.  \n(i)a variable or a constant is a term.  \n(ii)if t1,t₂are terms,so are(t1+t₂)and(-t1).  \n(iii)the only terms are those given by(i),(ii)above.  \nDef.2.  \n(i)If t1,t2 are terms,t₁=t2 is an(atomic)Formula.  \n(ii)If A and B are formulae so are(A&B),(A V B),(～A),(A→B)and(A→B).  \n(iii)If A is a formula and v is variable,(v)A and (3v)A areformulae.  \n(iv)the only formulae are those given by(i),(ii),(iii)above.  \nNote that the set of formulae is a countable set.  \nThere will be two types of axioms.  \n(i)Logical axioms e.g.if A is any formula,then A→A and(~～A)→A will be axioms.Such statements are universally true.  \n(ii)Mathematical axioms:These will be statements intended tocharacterise the type of structure being studied.e.g.,  \n(x)(x+0=x)  \n(x)(y)(x+y=y+x)  \nHowever,our axioms will not be all our truths.We must have somemeans of deduction.To this end we have a(finite)number of rules ofinference of which a typical example is modes ponens.  \n\"From A and A→B,to infer B.\"  \nDef.3.  \nA proof is a finite sequence of formulae,each of which is either anaxiom or follows from previous formulae in the sequence by one of thegiven rules of inference.A formal theorem is any formula which occursat the end","cbCaigjFBqmOiI5n","https://ap.wps.com/l/cbCaigjFBqmOiI5n","pdf",4241595,102,"English","# Some Theorems in Logic\n## Informal vs formal axiomatic systems\n## Symbols, terms, and formulas\n## Axioms and rules of inference\n## Proofs and theoremhood\n## Models and truth definitions","[{\"question\":\"What shift in logic does Parikh emphasize in the article?\",\"answer\":\"Parikh highlights the increasing tendency toward symbolisation and formalisation in logic, which matured with figures such as Russell, Hilbert, and Church.\"},{\"question\":\"How does the article define terms and (atomic) formulas?\",\"answer\":\"It defines variables/constants as terms, builds compound terms using addition and negation, and treats equality between two terms as an atomic formula.\"},{\"question\":\"What is a model in the sense used here, and how are formulas evaluated?\",\"answer\":\"A model consists of a nonempty set with distinguished element, function symbols for operations, and an interpretation map from symbols to elements. Truth of formulas is then defined recursively using the induced interpretation of terms.\"}]","Some Theorems in Logic | PDF",1791883617,257,11,[148,152,156,160,164,168,172,176,180,184,188],{"page_no":22,"url":149,"width":150,"height":151},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/c33574e05bbc67b53c5958d0282c7477.webp",983,1415,{"page_no":26,"url":153,"width":154,"height":155},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/ddd9e3baa290e292bb5bbc41c912f6d6.webp",982,1414,{"page_no":30,"url":157,"width":158,"height":159},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/06b538c3807f24501f5babda2f70905c.webp",981,1412,{"page_no":33,"url":161,"width":162,"height":163},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/5a2673b55aaa7bcacd9c00229db30764.webp",980,1411,{"page_no":97,"url":165,"width":166,"height":167},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/dfb3b4ce478733c9b28d9bb1fee46c19.webp",979,1409,{"page_no":102,"url":169,"width":170,"height":171},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/206719b73583029aca0bb866285930cd.webp",978,1408,{"page_no":107,"url":173,"width":174,"height":175},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/25f33b63e0e8bcc3ab86b7efb05d99e3.webp",977,1406,{"page_no":112,"url":177,"width":178,"height":179},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/b8dca52bc6c8c5f434eeb43cb1c0c1de.webp",976,1405,{"page_no":55,"url":181,"width":182,"height":183},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/251f1fb06f2bcaebb27debe7f88b3e7a.webp",975,1403,{"page_no":123,"url":185,"width":186,"height":187},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/1a6cadbe9ea8ab528b6a84d6cc794820.webp",974,1402,{"page_no":146,"url":189,"width":190,"height":191},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-18/068c86b71a42a7aa565abada46e096e0.webp",973,1401]