{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:00:39Z","timestamp":1725487239862},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727323"},{"type":"electronic","value":"9783540727347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72734-7_34","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T09:40:50Z","timestamp":1183023650000},"page":"486-497","source":"Crossref","is-referenced-by-count":17,"title":["Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms"],"prefix":"10.1007","author":[{"given":"V.","family":"Rybakov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"34_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":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45089-0_5","volume-title":"Implementation and Application of Automata","author":"C. Fritz","year":"2003","unstructured":"Fritz, C.: Constructing B\u00fcchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating B\u00fcchi Automata. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 35\u201348. Springer, Heidelberg (2003)"},{"key":"34_CR3","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.Y.: Improved automata generation for linear temporal logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 249\u2013260. Springer, Heidelberg (1999)"},{"issue":"3","key":"34_CR4","doi-asserted-by":"crossref","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":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-51803-7_36","volume-title":"Temporal Logic in Specification","author":"D. Gabbay","year":"1989","unstructured":"Gabbay, D.: The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems. In: Banieqbal, B., Pnueli, A., Barringer, H. (eds.) Temporal Logic in Specification. LNCS, vol.\u00a0398, pp. 409\u2013448. Springer, Heidelberg (1989)"},{"key":"34_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0013976","volume-title":"Temporal Logic: Mathematical Foundations and Computational Aspects, vol. 1","author":"D.M. Gabbay","year":"1994","unstructured":"Gabbay, D.M., Hodkinson, I.M., Reynolds, M.A.: Temporal Logic: Mathematical Foundations and Computational Aspects, vol. 1. Clarendon Press, Oxford (1994)"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1093\/logcom\/1.2.229","volume":"1","author":"D.M. Gabbay","year":"1990","unstructured":"Gabbay, D.M., Hodkinson, I.M.: An axiomatisation of the temporal logic with Until and Since over the real numbers. Journal of Logic and Computation\u00a01, 229\u2013260 (1990)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"34_CR8","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"},{"unstructured":"Goldblatt, R.: Logics of Time and Computation. CSLI Lecture Notes, vol.\u00a07 (1992)","key":"34_CR9"},{"issue":"5-6","key":"34_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1570-8683(03)00008-9","volume":"1","author":"R. Goldblatt","year":"2003","unstructured":"Goldblatt, R.: Mathematical Modal Logic: A View of its Evolution. J. Applied Logic\u00a01(5-6), 309\u2013392 (2003)","journal-title":"J. Applied Logic"},{"issue":"1","key":"34_CR11","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":"34_CR12","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":"34_CR13","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":"34_CR14","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1093\/logcom\/exi029","volume":"15","author":"E. Jer\u00e1bek","year":"2005","unstructured":"Jer\u00e1bek, 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":"34_CR15","doi-asserted-by":"publisher","first-page":"756","DOI":"10.2307\/2274361","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":"34_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/malq.200410009","volume":"51","author":"M. Lange","year":"2005","unstructured":"Lange, M.: A quick axiomatisation of LTL with past. Mathematical Logic Quarterly\u00a051(1), 83\u201388 (2005)","journal-title":"Mathematical Logic Quarterly"},{"doi-asserted-by":"crossref","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal Logic with Forgettable Past. In: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS\u201902), Copenhagen, Denmark, 2002, pp. 383\u2013392 (2002)","key":"34_CR17","DOI":"10.1109\/LICS.2002.1029846"},{"issue":"1","key":"34_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":"34_CR19","doi-asserted-by":"crossref","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, Heidelberg (1955)"},{"key":"34_CR20","doi-asserted-by":"crossref","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":"34_CR21","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":"34_CR22","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":"34_CR23","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 Computer Society Press, Los Alamitos (1977)"},{"issue":"5","key":"34_CR24","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF01982031","volume":"23","author":"V.V. Rybakov","year":"1984","unstructured":"Rybakov, V.V.: A Criterion for Admissibility of Rules in the Modal System S4 and the Intuitionistic Logic (Engl. Translation). Algebra and Logic\u00a023(5), 369\u2013384 (1984)","journal-title":"Algebra and Logic"},{"key":"34_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01978706","volume":"24","author":"V.V. Rybakov","year":"1985","unstructured":"Rybakov, V.V.: The Bases for Admissible Rules of Logics S4 and Int (English translation). Algebra and Logic\u00a024, 55\u201368 (1985)","journal-title":"Algebra and Logic"},{"issue":"3","key":"34_CR26","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"},{"key":"34_CR27","series-title":"Studies in Logic and the Found. of Mathematics","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(97)80001-8","volume-title":"Admissible Logical Inference Rules","author":"V.V. Rybakov","year":"1997","unstructured":"Rybakov, V.V.: Admissible Logical Inference Rules. Studies in Logic and the Found. of Mathematics, vol.\u00a0136. Elsevier Sci. Publ., Amsterdam (1997)"},{"issue":"4","key":"34_CR28","doi-asserted-by":"crossref","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":"34_CR29","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":"34_CR30","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":"34_CR31","doi-asserted-by":"crossref","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"},{"issue":"4","key":"34_CR32","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.2178\/jsl\/1129642119","volume":"70","author":"V.V. Rybakov","year":"2005","unstructured":"Rybakov, V.V.: Logical Consecutions in Discrete Linear Temporal Logic. Journal of Symbolic Logic\u00a070(4), 1137\u20131149 (2005)","journal-title":"Journal of Symbolic Logic"},{"doi-asserted-by":"crossref","unstructured":"Rybakov, V.V.: Branching Time Logic $\\mathcal{PTL}_\\alpha$ with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms. Submitted (2006)","key":"34_CR33","DOI":"10.1007\/s00224-007-9059-9"},{"issue":"3","key":"34_CR34","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The Complexity of Propositional Linear Temporal Logic. Journal of the ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Thomason, S.K.: Semantic Analysis of Tense Logic. Journal of Symbolic Logic\u00a037(1) (1972)","key":"34_CR35","DOI":"10.2307\/2272558"},{"key":"34_CR36","series-title":"Synthese Library","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-9868-7","volume-title":"The Logic of Time","author":"J. Benthem van","year":"1983","unstructured":"van Benthem, J.: The Logic of Time. Synthese Library, vol.\u00a0156. Reidel, Dordrecht (1983)"},{"unstructured":"Vardi, M.: An automata-theoretic approach to linear temporal logic. In: Proceedings of the Banff Workshop on Knowledge Acquisition, Banff\u201994 (1994)","key":"34_CR37"},{"key":"34_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 628\u2013641. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72734-7_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T18:30:24Z","timestamp":1683916224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72734-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727323","9783540727347"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72734-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}