{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:45:00Z","timestamp":1794339900739,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_33","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"322-333","source":"Crossref","is-referenced-by-count":17,"title":["Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms"],"prefix":"10.1007","author":[{"given":"V.","family":"Rybakov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Applied logic series","volume-title":"Advances in Temporal Logic","author":"H. Barringer","year":"1999","unstructured":"Barringer, H., Fisher, M., Gabbay, D., Gough, G.: Advances in Temporal Logic. Applied logic series, vol.\u00a016. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-48683-6_21","volume-title":"Computer Aided Verification","author":"R. Bloem","year":"1999","unstructured":"Bloem, R., Ravi, K., Somenzi, F.: Efficient Decision Procedures for Model Checking of Linear Time Logic Properties. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 222\u2013235. Springer, Heidelberg (1999)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/LICS.2001.932516","volume-title":"Proceedings of 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001)","author":"G. Bruns","year":"2001","unstructured":"Bruns, G., Godefroid, P.: Temporal Logic Query-Checking. In: Proceedings of 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001), Boston, MA, USA, June 2001, pp. 409\u2013417. IEEE Computer Society, Los Alamitos (2001)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58179-0_72","volume-title":"Computer Aided Verification","author":"E. Clarke","year":"1994","unstructured":"Clarke, E., Grumberg, O., Hamaguchi, K.P.: Another look at LTL Model Checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, Springer, Heidelberg (1994)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-58179-0_59","volume-title":"Computer Aided Verification","author":"C. David","year":"1994","unstructured":"David, C., Paliath, N.: Ground Temporal Logic: A Logic for Hardware Verification. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 247\u2013259. Springer, Heidelberg (1994)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-48683-6_23","volume-title":"Computer Aided Verification","author":"M. Daniele","year":"1999","unstructured":"Daniele, M., Giunchiglia, F., Vardi, M.: Improved Automata Gneration for Linear Temporal Logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 249\u2013260. Springer, Heidelberg (1999)"},{"key":"33_CR7","first-page":"996","volume-title":"Handbook of Theoretical Computer Science","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and Modal Logics. In: van Leenwen, J. (ed.) Handbook of Theoretical Computer Science, pp. 996\u20131072. Elsevier Science Publishers, The Netherlands (1990)"},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.2307\/2271891","volume":"40","author":"H. Friedman","year":"1975","unstructured":"Friedman, H.: One Hundred and Two Problems in Mathematical Logic. Journal of Symbolic Logic\u00a040(3), 113\u2013130 (1975)","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-94-009-8384-7_3","volume-title":"Aspects of Phil. Logic","author":"D. Gabbay","year":"1981","unstructured":"Gabbay, D.: An Irreflevivity Lemma with Applications to Axiomatizations of Conditions of Linear Frames. In: Monnich, V. (ed.) Aspects of Phil. Logic, pp. 67\u201389. Reidel, Dordrecht (1981)"},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"859","DOI":"10.2307\/2586506","volume":"64","author":"S. Ghilardi","year":"1999","unstructured":"Ghilardi, S.: Unification in Intuitionistic logic. Journal of Symbolic Logic\u00a064(2), 859\u2013880 (1999)","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR11","unstructured":"Goldblatt, R.: Logics of Time and Computation. CSLI Lecture Notes, vol.\u00a0(7) (1992)"},{"issue":"1","key":"33_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/logcom\/2.1.5","volume":"2","author":"V. Goranko","year":"1992","unstructured":"Goranko, V., Passy, S.: Using the Universal Modality: Gains and Questions. J. Log. Comput.\u00a02(1), 5\u201330 (1992)","journal-title":"J. Log. Comput."},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"van der Hoek, W., Wooldridge, M.: Model Checking Knowledge and Time. In: SPIN 2002, Proc. of the Ninth International SPIN Workshop on Model Checking of Software, Grenoble, France (2002)","DOI":"10.1007\/3-540-46017-9_9"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.2307\/2964334","volume":"25","author":"R. Harrop","year":"1960","unstructured":"Harrop, R.: Concerning Formulas of the Types A\u2192B\u2009\u2228\u2009C, A\u2192\u2009\u2203\u2009x B(x) in Intuitionistic Formal System. J. of Symbolic Logic\u00a025, 27\u201332 (1960)","journal-title":"J. of Symbolic Logic"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2694922","volume":"66","author":"R. Iemhoff","year":"2001","unstructured":"Iemhoff, R.: On the admissible rules of Intuitionistic Propositional Logic. J. of Symbolic Logic\u00a066, 281\u2013294 (2001)","journal-title":"J. of Symbolic Logic"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1093\/logcom\/exi029","volume":"15","author":"E. Jerabek","year":"2005","unstructured":"Jerabek, E.: Admissible Rules of Modal Logics. J. of Logic and Computation\u00a015, 411\u2013431 (2005)","journal-title":"J. of Logic and Computation"},{"issue":"3","key":"33_CR17","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1017\/S002248120002973X","volume":"52","author":"B.M. Kapron","year":"1987","unstructured":"Kapron, B.M.: Modal Sequents and Definability. J. of Symbolic Logic\u00a052(3), 756\u2013765 (1987)","journal-title":"J. of Symbolic Logic"},{"issue":"1","key":"33_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/jigpal\/8.1.55","volume":"8","author":"O. Lichtenstein","year":"2000","unstructured":"Lichtenstein, O., Pnueli, A.: Propositional temporal logics: Decidability and completeness. Logic Journal of the IGPL\u00a08(1), 55\u201385 (2000)","journal-title":"Logic Journal of the IGPL"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal Logic with Forgettable Past. In: IEEE Symp. Logic in Computer Science (LICS 2002)","DOI":"10.1109\/LICS.2002.1029846"},{"key":"33_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-01539-1","volume-title":"Einf\u00fchrung in die operative Logik und Mathematik","author":"P. Lorenzen","year":"1955","unstructured":"Lorenzen, P.: Einf\u00fchrung in die operative Logik und Mathematik. Springer, Berlin-G\u00f6ttingen, Heidelberg (1955)"},{"key":"33_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4222-2","volume-title":"Temporal Verification of Reactive Systems: Safety","author":"Z. Manna","year":"1995","unstructured":"Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)"},{"key":"33_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)"},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1008700623084","volume":"16","author":"N. Bjorner","year":"2000","unstructured":"Bjorner, N., Browne, A., Colon, M., Finkbeiner, B., Manna, Z., Sipma, H., Uribe, T.: Verifying Temporal Properties of Reactive Systems: A Step Tutorial. Formal Methods in System Design\u00a016, 227\u2013270 (2000)","journal-title":"Formal Methods in System Design"},{"key":"33_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-45022-X_37","volume-title":"Automata, Languages and Programming","author":"Z. Manna","year":"2000","unstructured":"Manna, Z., Sipma, H.: Alternating the Temporal Picture for Safety. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 429\u2013450. Springer, Heidelberg (2000)"},{"issue":"4","key":"33_CR25","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/BF01084082","volume":"6","author":"G.E. Mints","year":"1976","unstructured":"Mints, G.E.: Derivability of Admissible Rules. J. of Soviet Mathematics\u00a06(4), 417\u2013421 (1976)","journal-title":"J. of Soviet Mathematics"},{"key":"33_CR26","first-page":"46","volume-title":"Proc. of the 18th Annual Symp. on Foundations of Computer Science","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The Temporal Logic of Programs. In: Proc. of the 18th Annual Symp. on Foundations of Computer Science, pp. 46\u201357. IEEE, Los Alamitos (1977)"},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45694-5_2","volume-title":"CONCUR 2002 - Concurrency Theory","author":"A. Pnueli","year":"2002","unstructured":"Pnueli, A., Kesten, Y.: A deductive proof system for CTL *. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 24\u201340. Springer, Heidelberg (2002)"},{"key":"33_CR28","doi-asserted-by":"crossref","unstructured":"Rybakov, V.V.: A Criterion for Admissibility of Rules in the Modal System S4 and the Intuitionistic Logic. Algebra and Logic\u00a023(5), 369\u2013384 (1984) (Engl. Translation)","DOI":"10.1007\/BF01982031"},{"key":"33_CR29","doi-asserted-by":"crossref","unstructured":"Rybakov, V.V.: The Bases for Admissible Rules of Logics S4 and Int. Algebra and Logic\u00a024, 55\u201368 (1985) (English translation)","DOI":"10.1007\/BF01978706"},{"issue":"3","key":"33_CR30","doi-asserted-by":"publisher","first-page":"912","DOI":"10.2307\/2275439","volume":"57","author":"V.V. Rybakov","year":"1992","unstructured":"Rybakov, V.V.: Rules of Inference with Parameters for Intuitionistic logic. Journal of Symbolic Logic\u00a057(3), 912\u2013923 (1992)","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"33_CR31","doi-asserted-by":"publisher","first-page":"266","DOI":"10.2307\/2275521","volume":"60","author":"V.V. Rybakov","year":"1995","unstructured":"Rybakov, V.V.: Hereditarily Structurally Complete Modal Logics. Journal of Symbolic Logic\u00a060(1), 266\u2013288 (1995)","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR32","doi-asserted-by":"crossref","unstructured":"Rybakov, V.V.: Modal Logics Preserving Admissible for S4 Inference Rules. In: Proceedings of the conference CSL 1994. LNCS, vol.\u00a0(993), pp. 512\u2013526. Springer, Heidelberg (1995)","DOI":"10.1007\/BFb0022279"},{"key":"33_CR33","first-page":"617","volume-title":"Studies in Logic and the Found. of Mathematics","author":"V.V. Rybakov","year":"1997","unstructured":"Rybakov, V.V.: Admissible Logical Inference Rules. In: Studies in Logic and the Found. of Mathematics, vol.\u00a0136, p. 617. Elsevier Sci. Publ, North-Holland (1997)"},{"key":"33_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-63045-7_34","volume-title":"Logical Foundations of Computer Science","author":"V.V. Rybakov","year":"1997","unstructured":"Rybakov, V.V.: Quasi-characteristic Inference Rules. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol.\u00a01234, pp. 333\u2013342. Springer, Heidelberg (1997)"},{"issue":"4","key":"33_CR35","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1002\/malq.19990450409","volume":"45","author":"V.V. Rybakov","year":"1999","unstructured":"Rybakov, V.V., Kiyatkin, V.R., Oner, T.: On Finite Model Property For Admissible Rules. Mathematical Logic Quarterly\u00a045(4), 505\u2013520 (1999)","journal-title":"Mathematical Logic Quarterly"},{"issue":"2","key":"33_CR36","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1521-3870(200005)46:2<207::AID-MALQ207>3.0.CO;2-E","volume":"46","author":"V.V. Rybakov","year":"2000","unstructured":"Rybakov, V.V., Terziler, M., Rimazki, V.: Basis in Semi-Reduced Form for the Admissible Rules of the Intuitionistic Logic IPC. Mathematical Logic Quarterly\u00a046(2), 207\u2013218 (2000)","journal-title":"Mathematical Logic Quarterly"},{"issue":"4","key":"33_CR37","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/1521-3870(200111)47:4<441::AID-MALQ441>3.0.CO;2-J","volume":"47","author":"V.V. Rybakov","year":"2001","unstructured":"Rybakov, V.V.: Construction of an Explicit Basis for Rules Admissible in Modal System S4. Mathematical Logic Quarterly\u00a047(4), 441\u2013451 (2001)","journal-title":"Mathematical Logic Quarterly"},{"issue":"5","key":"33_CR38","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1093\/logcom\/exi025","volume":"15","author":"V.V. Rybakov","year":"2005","unstructured":"Rybakov, V.V.: Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals. Journal of Logic Computation\u00a015(5), 633\u2013657 (2005)","journal-title":"Journal of Logic Computation"},{"key":"33_CR39","unstructured":"Vardi, M.: An automata-theoretic approach to linear temporal logic. In: The Book: Proceedings of the Banff Workshop on Knowledge Acquisition (Banff 1994) (1994)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:38Z","timestamp":1619492618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/11753728_33","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}