{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T12:45:08Z","timestamp":1698842708446},"reference-count":23,"publisher":"Hindawi Limited","license":[{"start":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T00:00:00Z","timestamp":1361836800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advances in Artificial Intelligence"],"published-print":{"date-parts":[[2013,2,26]]},"abstract":"<jats:p>We considered an extension of the first-order logic (FOL) by Bealer's intensional abstraction operator. Contemporary use of the term \u201cintension\u201d derives from the traditional logical Frege-Russell doctrine that an idea (logic formula) has both an extension and an intension. Although there is divergence in formulation, it is accepted that the \u201cextension\u201d of an idea consists of the subjects to which the idea applies, and the \u201cintension\u201d consists of the attributes implied by the idea. From the Montague's point of view, the meaning of an idea can be considered as particular extensions in different possible worlds. In the case of standard FOL, we obtain a commutative homomorphic diagram, which is valid in each given possible world of an intensional FOL: from a free algebra of the FOL syntax, into its intensional algebra of concepts, and, successively, into an extensional relational algebra (different from Cylindric algebras). Then we show that this composition corresponds to the Tarski's interpretation of the standard extensional FOL in this possible world.<\/jats:p>","DOI":"10.1155\/2013\/920157","type":"journal-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T21:04:06Z","timestamp":1361912646000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["Conservative Intensional Extension of Tarski's Semantics"],"prefix":"10.1155","volume":"2013","author":[{"given":"Zoran","family":"Majki\u0107","sequence":"first","affiliation":[{"name":"International Society for Research in Science and Technology, P.O. Box 2464, Tallahassee, FL 32316-2464, USA"}]}],"member":"98","reference":[{"issue":"1-2","key":"1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(93)90017-6","volume":"63","year":"1993","journal-title":"Artificial Intelligence"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2003.11.014"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exn005"},{"key":"4","volume-title":"First-order modal logic","year":"2007"},{"issue":"4","key":"6","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0743-1066(92)90055-8","volume":"13","year":"1992","journal-title":"The Journal of Logic Programming"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.2307\/2940824"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.2307\/2025697"},{"key":"30","volume-title":"Relational completeness of data base sublanguages","year":"1972"},{"key":"9","year":"1986"},{"key":"10","year":"1984"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1111\/j.1755-2567.1970.tb00434.x"},{"key":"12","volume-title":"The proper treatment of quantification in ordinary English","year":"1973"},{"key":"13","year":"1974"},{"key":"14"},{"key":"15","series-title":"Lecture Notes in Computer Science","volume-title":"Intensional first-order logic for P2P database systems","volume":"5480","year":"2009"},{"key":"17","year":"1982"},{"key":"20","series-title":"Lecture Notes in Computer Science","volume-title":"Intensional semantics for P2P data integration","volume":"4090","year":"2006"},{"key":"24","year":"1971"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/984514.984516"},{"key":"26","first-page":"22","volume":"100","year":"1892","journal-title":"Zeitschrift f\u00fcr Philosophie und philosophische Kritik"},{"key":"27","series-title":"Mind","volume-title":"On Denoting","volume":"14","year":"1905"},{"key":"28","volume":"1","year":"1910"},{"key":"29","year":"1947"}],"container-title":["Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/archive\/2013\/920157.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/archive\/2013\/920157.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/archive\/2013\/920157.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T17:54:45Z","timestamp":1607622885000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/aai\/2013\/920157\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,26]]},"references-count":23,"alternative-id":["920157","920157"],"URL":"https:\/\/doi.org\/10.1155\/2013\/920157","relation":{},"ISSN":["1687-7470","1687-7489"],"issn-type":[{"value":"1687-7470","type":"print"},{"value":"1687-7489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,26]]}}}