{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:13:48Z","timestamp":1725574428769},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221456"},{"type":"electronic","value":"9783540247715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24771-5_19","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T17:41:39Z","timestamp":1294508499000},"page":"215-226","source":"Crossref","is-referenced-by-count":1,"title":["Rasiowa-Sikorski Style Relational Elementary Set Theory"],"prefix":"10.1007","author":[{"given":"Eugenio","family":"Omodeo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewa","family":"Or\u0142owska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1093\/logcom\/7.2.251","volume":"7","author":"J.F.A.K. Benthem van","year":"1997","unstructured":"van Benthem, J.F.A.K., D\u2019Agostino, G., Montanari, A., Policriti, A.: Modal deduction in second-order logic and set theory-I. Journal of Logic and Computation\u00a07(2), 251\u2013265 (1997)","journal-title":"Journal of Logic and Computation"},{"key":"19_CR2","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3452-2","volume-title":"Set theory for computing. from decision procedures to declarative programming with sets","author":"D. Cantone","year":"2001","unstructured":"Cantone, D., Omodeo, E.G., Policriti, A.: Set theory for computing. from decision procedures to declarative programming with sets. Monographs in Computer Science. Springer, Heidelberg (2001)"},{"issue":"15","key":"19_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF00881803","volume":"3","author":"G. D\u2019Agostino","year":"1995","unstructured":"D\u2019Agostino, G., Montanari, A., Policriti, A.: A set-theoretic translation method for polymodal logics. Journal of Automated Reasoning\u00a03(15), 317\u2013337 (1995)","journal-title":"Journal of Automated Reasoning"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"D\u00fcntsch, I., Or\u0142owska, E.: A proof system for contact relation algebras. Journal of Philosophical Logic\u00a0(29), 241\u2013262 (2000)","DOI":"10.1023\/A:1004764610651"},{"key":"19_CR5","unstructured":"Frias, M., Or\u0142owska, E.: A proof system for fork algebras and its applications to reasoning in logics based on intuitionism. Logique et Analyse\u00a0(150-151-152), 239\u2013284 (1995)"},{"issue":"1-2","key":"19_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/11663081.1998.10510932","volume":"8","author":"M. Frias","year":"1998","unstructured":"Frias, M., Or\u0142owska, E.: Equational reasoning in nonclassical logics. Journal of Applied Non-Classical Logics\u00a08(1-2), 27\u201366 (1998)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Formisano, A., Omodeo, E.G., Policriti, A.: Three-variable statements of set-pairing (2003) (submitted)","DOI":"10.1016\/j.tcs.2004.03.028"},{"key":"19_CR8","volume-title":"Set theory","author":"T.J. Jech","year":"1978","unstructured":"Jech, T.J.: Set theory. Springer, New York (1978)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1023\/A:1020572931854","volume":"71","author":"W. MacCaull","year":"2002","unstructured":"MacCaull, W., Or\u0142owska, E.: Correspondence results for relational proof systems with application to the Lambek calculus. Studia Logica\u00a071, 279\u2013304 (2002)","journal-title":"Studia Logica"},{"key":"19_CR10","volume-title":"The mathematics of metamathematics","author":"H. Rasiowa","year":"1963","unstructured":"Rasiowa, H., Sikorski, R.: The mathematics of metamathematics. Polish Scientific Publishers, Warsaw (1963)"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Demri, S., Or\u0142owska, E.: Logical analysis of demonic nondeterministic programs. Theoretical Computer Science\u00a0(166), 173\u2013202 (1996)","DOI":"10.1016\/0304-3975(95)00190-5"}],"container-title":["Lecture Notes in Computer Science","Relational and Kleene-Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24771-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:56:09Z","timestamp":1605761769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24771-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221456","9783540247715"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24771-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}