{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:56:32Z","timestamp":1648803392976},"reference-count":6,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T00:00:00Z","timestamp":1604534400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,1,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Graph normal form, introduced earlier for propositional logic, is shown to be a normal form also for first-order logic. It allows to view syntax of theories as digraphs, while their semantics as kernels of these digraphs. Graphs are particularly well suited for studying circularity, and we provide some general means for verifying that circular or apparently circular extensions are conservative. Traditional syntactic means of ensuring conservativity, like definitional extensions or positive occurrences guaranteeing exsitence of fixed points, emerge as special cases.<\/jats:p>","DOI":"10.1093\/jigpal\/jzaa054","type":"journal-article","created":{"date-parts":[[2020,9,8]],"date-time":"2020-09-08T19:13:09Z","timestamp":1599592389000},"page":"101-123","source":"Crossref","is-referenced-by-count":0,"title":["Extensions in graph normal form"],"prefix":"10.1093","volume":"30","author":[{"given":"Micha\u0142","family":"Walicki","sequence":"first","affiliation":[{"name":"Department of Informatics, University of Bergen, Norway"}]}],"member":"286","published-online":{"date-parts":[[2020,11,5]]},"reference":[{"key":"2022011721343322300_ref1","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.apal.2011.08.004","article-title":"Expressive power of digraph solvability","volume":"163","author":"Bezem","year":"2012","journal-title":"Annals of Pure and Applied Logic"},{"key":"2022011721343322300_ref2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5938.001.0001","volume-title":"The Revision Theory of Truth","author":"Gupta","year":"1993"},{"key":"2022011721343322300_ref3","doi-asserted-by":"crossref","first-page":"573","DOI":"10.2307\/1969755","article-title":"Solutions of irreflexive relations","volume":"58","author":"Richardson","year":"1953","journal-title":"The Annals of Mathematics, Second Series"},{"key":"2022011721343322300_ref4","volume-title":"Theory of Games and Economic Behavior","author":"Neumann","year":"1944"},{"key":"2022011721343322300_ref5","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1017\/jsl.2016.18","article-title":"Resolving infinitary paradoxes","volume":"82","author":"Walicki","year":"2017","journal-title":"Journal of Symbolic Logic"},{"key":"2022011721343322300_ref6","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/j.disc.2018.10.026","article-title":"Kernels of digraphs with finitely many ends","volume":"342","author":"Walicki","year":"2019","journal-title":"Discrete Mathematics"}],"container-title":["Logic Journal of the IGPL"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/30\/1\/101\/42198255\/jzaa054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/30\/1\/101\/42198255\/jzaa054.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T21:34:51Z","timestamp":1642455291000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jigpal\/article\/30\/1\/101\/5954216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,5]]},"references-count":6,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,11,5]]},"published-print":{"date-parts":[[2022,1,11]]}},"URL":"https:\/\/doi.org\/10.1093\/jigpal\/jzaa054","relation":{},"ISSN":["1367-0751","1368-9894"],"issn-type":[{"value":"1367-0751","type":"print"},{"value":"1368-9894","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,2]]},"published":{"date-parts":[[2020,11,5]]}}}