{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:06Z","timestamp":1725544626479},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333395"},{"type":"electronic","value":"9783540333401"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11734673_19","type":"book-chapter","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T21:59:04Z","timestamp":1151963944000},"page":"237-248","source":"Crossref","is-referenced-by-count":3,"title":["Quantifier Elimination in Elementary Set Theory"],"prefix":"10.1007","author":[{"given":"Ewa","family":"Or\u0142owska","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Sza\u0142as","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF01448035","volume":"110","author":"W. Ackermann","year":"1935","unstructured":"Ackermann, W.: Untersuchungen \u00fcber das Eliminationsproblem der Mathematischen Logik. Mathematische Annalen\u00a0110, 390\u2013413 (1935)","journal-title":"Mathematische Annalen"},{"key":"19_CR2","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Rudiments of \u03bc-calculus","author":"A. Arnold","year":"2001","unstructured":"Arnold, A., Niwinski, D.: Rudiments of \u03bc-calculus. Studies in Logic and the Foundations of Mathematics. Elsevier, Amsterdam (2001)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Relational and Kleene-Algebraic Methods in Computer Science","year":"2004","unstructured":"Berghammer, R., M\u00f6ller, B., Struth, G. (eds.): RelMiCS 2003. LNCS, vol.\u00a03051. Springer, Heidelberg (2004)"},{"issue":"15","key":"19_CR4","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_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(95)00190-5","volume":"166","author":"S. Demri","year":"1996","unstructured":"Demri, S., Or\u0142owska, E.: Logical analysis of demonic nondeterministic programs. Theoretical Computer Science\u00a0166, 173\u2013202 (1996)","journal-title":"Theoretical Computer Science"},{"key":"19_CR6","first-page":"219","volume-title":"Rough-Neuro Computing: Techniques for Computing with Words","author":"P. Doherty","year":"2003","unstructured":"Doherty, P., Kachniarz, J., Sza\u0142as, A.: Using contextually closed queries for local closed-world reasoning in rough knowledge databases. In: Pal, S.K., Polkowski, L., Skowron, A. (eds.) Rough-Neuro Computing: Techniques for Computing with Words, pp. 219\u2013250. Springer, Heidelberg (2003)"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1005722130532","volume":"18","author":"P. Doherty","year":"1997","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: Computing circumscription revisited. Journal of Automated Reasoning\u00a018(3), 297\u2013336 (1997)","journal-title":"Journal of Automated Reasoning"},{"issue":"5","key":"19_CR8","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1093\/logcom\/9.5.737","volume":"9","author":"P. Doherty","year":"1999","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: Declarative PTIME queries for relational databases using quantifier elimination. Journal of Logic and Computation\u00a09(5), 739\u2013761 (1999)","journal-title":"Journal of Logic and Computation"},{"key":"19_CR9","unstructured":"Doherty, P., \u0141ukaszewicz, W., Sza\u0142as, A.: Computing strongest necessary and weakest sufficient conditions of first-order formulas. In: International Joint Conference on AI (IJCAI 2001), pp. 145\u2013151 (2000)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1004764610651","volume":"29","author":"I. D\u00fcntsch","year":"2000","unstructured":"D\u00fcntsch, I., Or\u0142owska, E.: A proof system for contact relation algebras. Journal of Philosophical Logic\u00a029, 241\u2013262 (2000)","journal-title":"Journal of Philosophical Logic"},{"key":"19_CR11","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 150, 151, 152, 239\u2013284 (1995)"},{"key":"19_CR12","first-page":"425","volume-title":"Principles of Knowledge representation and reasoning, KR 1992","author":"D.M. Gabbay","year":"1992","unstructured":"Gabbay, D.M., Ohlbach, H.J.: Quantifier elimination in second-order predicate logic. In: Nebel, B., Rich, C., Swartout, W. (eds.) Principles of Knowledge representation and reasoning, KR 1992, pp. 425\u2013435. Morgan Kaufmann, San Francisco (1992)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Kachniarz, J., Sza\u0142as, A.: On a static approach to verification of integrity constraints in relational databases. In: [29], pp. 97\u2013109 (2001)","DOI":"10.1007\/978-3-7908-1828-4_6"},{"key":"19_CR14","first-page":"133","volume":"6","author":"B. Knaster","year":"1928","unstructured":"Knaster, B.: Un theoreme sur les fonctions d\u2019ensembles. Ann. Soc. Polon. Math.\u00a06, 133\u2013134 (1928)","journal-title":"Ann. Soc. Polon. Math."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Konikowska, B., Or\u0142owska, E.: A relational formalisation of a generic many-valued modal logic. In: [29], pp. 183\u2013202 (2001)","DOI":"10.1007\/978-3-7908-1828-4_11"},{"key":"19_CR16","first-page":"229","volume-title":"Proc. 9th IJCAI","author":"V. Lifschitz","year":"1985","unstructured":"Lifschitz, V.: Computing circumscription. In: Proc. 9th IJCAI, pp. 229\u2013235. Morgan Kaufmann, San Francisco (1985)"},{"key":"19_CR17","first-page":"297","volume-title":"Handbook of Artificial Intelligence and Logic Programming","author":"V. Lifschitz","year":"1991","unstructured":"Lifschitz, V.: Circumscription. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Artificial Intelligence and Logic Programming, vol.\u00a03, pp. 297\u2013352. Oxford University Press, Oxford (1991)"},{"issue":"3","key":"19_CR18","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: an International Journal for Symbolic Logic\u00a071(3), 279\u2013304 (2002)","journal-title":"Studia Logica: an International Journal for Symbolic Logic"},{"key":"19_CR19","first-page":"159","volume-title":"Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I","author":"A. Nonnengart","year":"1999","unstructured":"Nonnengart, A., Ohlbach, H.J., Sza\u0142as, A.: Elimination of predicate quantifiers. In: Ohlbach, H.J., Reyle, U. (eds.) Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I, pp. 159\u2013181. Kluwer, Dordrecht (1999)"},{"key":"19_CR20","series-title":"Studies in Fuzziness and Soft Computing","first-page":"307","volume-title":"Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa","author":"A. Nonnengart","year":"1998","unstructured":"Nonnengart, A., Sza\u0142as, A.: A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. In: Or\u0142owska, E. (ed.) Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa. Studies in Fuzziness and Soft Computing, vol.\u00a024, pp. 307\u2013328. Springer, Physical-verlag (1998)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Omodeo, E., Or\u0142owska, E., Policriti, A.: Rasiowa-Sikorski style relational elementary set theory. In: Berghammer, R., Moeller, B., Struth, G. (eds.) [3], pp. 213\u2013224 (2004)","DOI":"10.1007\/978-3-540-24771-5_19"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/11663081.1993.10510805","volume":"3","author":"E. Or\u0142owska","year":"1993","unstructured":"Or\u0142owska, E.: Dynamic logic with program specifications and its relational proof system. Journal of Applied Non-Classical Logic\u00a03, 147\u2013171 (1993)","journal-title":"Journal of Applied Non-Classical Logic"},{"key":"19_CR23","unstructured":"Or\u0142owska, E.: Relational interpretation of modal logics. In: Andreka, H., Monk, D., Nemeti, I. (eds.) Algebraic Logic. Colloquia Mathematica Societatis Janos Bolyai, vol.\u00a054, pp. 443\u2013471 (1988)"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.2307\/2275375","volume":"57","author":"E. Or\u0142owska","year":"1992","unstructured":"Or\u0142owska, E.: Relational proof systems for relevant logics. Journal of Symbolic Logic\u00a057, 1425\u20131440 (1992)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Or\u0142owska, E.: Relational semantics for non-classical logics: Formulas are relations. In: Wole\u0144ski, J. (ed.) Philosophical Logic in Poland, pp. 167\u2013186 (1994)","DOI":"10.1007\/978-94-015-8273-5_11"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Or\u0142owska, E.: Relational proof systems for modal logics. In: Wansing, H. (ed.) Proof Theory of Modal Logics, pp. 55\u201377 (1996)","DOI":"10.1007\/978-94-017-2798-3_5"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Or\u0142owska, E.: Relational formalisation of nonclassical logics. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science, pp. 90\u2013105 (1997)","DOI":"10.1007\/978-3-7091-6510-2_6"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Or\u0142owska, E., McCaull, W.: A calculus of typed relations. In: [3], pp. 152\u2013158 (2004)","DOI":"10.1007\/978-3-540-24771-5_17"},{"volume-title":"Relational Methods for Computer Science Applications","year":"2001","key":"19_CR29","unstructured":"Or\u0142owska, E., Sza\u0142as, A. (eds.): Relational Methods for Computer Science Applications. Springer, Heidelberg (2001)"},{"key":"19_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/logcom\/4.1.23","volume":"4","author":"H. Simmons","year":"1994","unstructured":"Simmons, H.: The monotonous elimination of predicate variables. Journal of Logic and Computation\u00a04, 23\u201368 (1994)","journal-title":"Journal of Logic and Computation"},{"key":"19_CR31","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1093\/logcom\/3.6.605","volume":"3","author":"A. Sza\u0142as","year":"1993","unstructured":"Sza\u0142as, A.: On the correspondence between modal and classical logic: An automated approach. Journal of Logic and Computation\u00a03, 605\u2013620 (1993)","journal-title":"Journal of Logic and Computation"},{"key":"19_CR32","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1080\/11663081.1994.10510828","volume":"4","author":"A. Sza\u0142as","year":"1994","unstructured":"Sza\u0142as, A.: On an automated translation of modal proof rules into formulas of the classical logic. Journal of Applied Non-Classical Logics\u00a04, 119\u2013127 (1994)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"19_CR33","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45757-7_19","volume-title":"Logics in Artificial Intelligence","author":"A. Sza\u0142as","year":"2002","unstructured":"Sza\u0142as, A.: Second-order quantifier elimination in modal contexts. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol.\u00a02424, pp. 223\u2013232. Springer, Heidelberg (2002)"},{"key":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-45077-1_39","volume-title":"Fundamentals of Computation Theory","author":"A. Sza\u0142as","year":"2003","unstructured":"Sza\u0142as, A.: On a logical approach to estimating computational complexity of potentially intractable problems. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 423\u2013431. Springer, Heidelberg (2003)"},{"issue":"2","key":"19_CR35","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1965","unstructured":"Tarski, A.: A Lattice-theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics\u00a05(2), 285\u2013309 (1965)","journal-title":"Pacific Journal of Mathematics"},{"key":"19_CR36","unstructured":"van Benthem, J.: Modal Logic and Classical Logic. Bibliopolis, Naples (1983)"},{"key":"19_CR37","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-94-009-6259-0_4","volume-title":"Handbook of Philosophical Logic","author":"J. Benthem van","year":"1984","unstructured":"van Benthem, J.: Correspondence theory. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol.\u00a02, pp. 167\u2013247. D. Reidel Pub. Co., Dordrecht (1984)"}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734673_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T22:33:05Z","timestamp":1683498785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734673_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333395","9783540333401"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/11734673_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}