Publications

2023

Cachin, Christian; Lehnherr, David; Studer, Thomas (October 2023). Synergistic Knowledge. In: Dolev, Shlomi; Schieber, Baruch (eds.) 25th International Symposium on Stabilizing, Safety, and Security of Distributed Systems. Lecture notes in computer science (pp. 552-567). Springer 10.1007/978-3-031-44274-2_41

Jäger, Gerhard (2023). Identity, Equality, and Extensionality in Explicit Mathematics. In: Bridges, Douglas; Ishihara, Hajime; Rathjen, Michael; Schwichtenberg, Helmut (eds.) Handbook of Constructive Mathematics. Encyclopedia of Mathematics and its Applications (pp. 564-583). Cambridge University Press 10.1017/9781009039888.022

Sato, Kentaro; Walker, Jan (2023). Finitist Axiomatic Truth. The journal of symbolic logic, 88(1), pp. 22-73. Cambridge University Press 10.1017/jsl.2022.65

Luo, Jieting; Dastani, Mehdi; Studer, Thomas; Liao, Beishui (2023). What do you care about: inferring values from emotions. In: Proceedings of the 22st International Conference on Autonomous Agents and Multiagent Systems.

Luo, Jieting; Dastani, Mehdi; Studer, Thomas (2023). Getting Emotional from Emotions: Modeling Affective Reaction in Multi-agent Systems (Submitted). Journal of logic and computation Oxford University Press

Afshari, Bahareh; Grotenhuis, Lide; Leigh, Graham E; Zenger, Lukas (2023). Ill-Founded Proof Systems for Intuitionistic Linear-Time Temporal Logic. Lecture notes in computer science, 14278, pp. 223-241. Springer 10.1007/978-3-031-43513-3_13

Fernández-Duque, David; McLean, Brett; Zenger, Lukas (2023). A Family of Decidable Bi-intuitionistic Modal Logics. In: Marquis, Pierre; Son, Tran Cao; Kern-Isberner, Gabriele (eds.) 20th International Conference on Principles of Knowledge Representation and Reasoning. Rhodes, Greece. September 2-8, 2023. 10.24963/kr.2023/26

Cachin, Christian; Lehnherr, David; Studer, Thomas (2023). Modal and Justification Logics for Multi-agent Systems (Invited Talk). In: Herzig, Andreas; Luo, Jieting; Pardo, Pere (eds.) International Conference on Logic and Argumentation, 2023. Lecture Notes in Computer Science: Vol. 14156 (pp. 3-8). Cham: Springer Nature Switzerland 10.1007/978-3-031-40875-5_1

Luo, Jieting; Studer, Thomas; Dastani, Mehdi (2023). Providing Personalized Explanations: A Conversational Approach. In: Herzig, Andreas; Luo, Jieting; Pardo, Pere (eds.) International Conference on Logic and Argumentation, 2023. Lecture Notes in Computer Science: Vol. 14156 (pp. 121-137). Cham: Springer Nature Switzerland 10.1007/978-3-031-40875-5_8

Faroldi, Federico L. G.; Rohani, Atefeh; Studer, Thomas (2023). Conditional Obligations in Justification Logic. In: Hansen, Helle Hvid; Scedrov, Andre; de Queiroz, Ruy J.G.B. (eds.) 29th International Workshop on Logic, Language, Information, and Computation, 2023. Lecture Notes in Computer Science: Vol. 13923 (pp. 178-193). Cham: Springer Nature Switzerland 10.1007/978-3-031-39784-4_11

2022

Lehnherr, David; Ognjanović, Zoran; Studer, Thomas (2022). A logic of interactive proofs. Journal of logic and computation, 32(8), pp. 1645-1658. Oxford University Press 10.1093/logcom/exac071

Jäger, Gerhard (2022). Stage comparison, fixed points, and least fixed points in Kripke–Platek environments. Notre Dame journal of formal logic, 63(4), pp. 443-461. Duke University Press 10.1215/00294527-2022-0025

Stähli, Olivier; Ost, Thomas; Studer, Thomas (May 2022). Development of an AI-based bioacoustic wolf monitoring system. In: Bartàk, Roman; Keshtkar, Fazel; Franklin, Michael (eds.) Thirty-Fifth International Florida Artificial Intelligence Research Society Conference. Hutchinson Island, Jensen Beach, Florida, USA. 15-18 May 2022.

Lehnherr, David; Ognjanović, Zoran; Studer, Thomas (2022). A Logic of Interactive Proofs. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science. LFCS 2022. Lecture Notes in Computer Science: Vol. 13137 (pp. 143-155). Springer 10.1007/978-3-030-93100-1_10

Doder, Dragan; Ognjanović, Zoran; Savić, Nenad; Studer, Thomas (2022). Incomplete Information and Justifications. In: Özgün, Aybüke; Zinova, Yulia (eds.) Logic, Language and Computation TbiLLC 2019. Lecture Notes in Computer Science: Vol. 13206 (pp. 258-278). Springer 10.1007/978-3-030-98479-3_13

Rooduijn, Jan; Zenger, Lukas (2022). An analytic proof system for common knowledge logic over S5. In: Fernández-Duque, David; Palmigiano, Alessandra; Pinchinat, Sophie (eds.) Proceedings of AiML 2022. Advances in Modal Logic: Vol. 14 (pp. 659-680). College Publications

Jäger, Gerhard (2022). Simplified cut elimination for Kripke-Platek set theory. In: Ferreira, Fernando; Kahle, Reinhard; Sommaruga, Giovanni (eds.) Axiomatic Thinking II (pp. 9-34). Springer 10.1007/978-3-030-77799-9_2

Faroldi, Federico L G; Ghari, Meghdad; Lehmann, Eveline; Studer, Thomas (2022). Consistency and permission in deontic justification logic. Journal of logic and computation, 34(4), pp. 640-664. Oxford University Press 10.1093/logcom/exac045

Luo, Jieting; Liao, Beishui; Gabbay, Dov (2022). Value-based Practical Reasoning: Modal Logic + Argumentation (In Press). In: COMMA - Computational Models of Argument. Conference Proceedings.

2021

Baur, Michael; Studer, Thomas (2021). Semirings of Evidence. Journal of logic and computation, 31(8), pp. 2084-2106. Oxford University Press 10.1093/logcom/exab007

Studer, T. (2021). The impossibility of keeping secrets. Malaysian Journal of Mathematical Sciences, 15, pp. 91-104. UPM

Rohani, Atefeh; Studer, Thomas (5 October 2021). Explicit Non-normal Modal Logic. In: Silva, Alexandra; Wassermann, Renata; de Queiroz, Ruy (eds.) WoLLIC 2021 - 27th Workshop on Logic, Language, Information and Computation. Lecture Notes in Computer Science: Vol. 13038 (pp. 64-81). Springer 10.1007/978-3-030-88853-4_5

Bärtschi, Michael (2021). ATR_0 and Some Related Theories. (Dissertation, Philosophisch-naturwissenschaftliche Fakultät)

Jäger, Gerhard (2021). Short note: Least fixed points versus least closed points. Archive for mathematical logic, 60(7-8), pp. 831-835. Springer-Verlag 10.1007/s00153-021-00761-y

Lehmann, Eveline (2021). Subset Semantics for Justifications. (Dissertation, Universität Bern, Philosophisch-naturwissenschaftlichen Fakultät)

Studer, Thomas (2021). A conflict tolerant logic of explicit evidence. Logical investigations, 27(1), pp. 124-144.

Lehmann, Eveline; Studer, Thomas (2021). Exploring Subset Models for Justification Logic. In: Fitting, Melvin (ed.) Selected Topics from Contemporary Logics. London: College Publications

2020

Savic, Nenad (2020). Non-classical Reasoning and Justifications. (Dissertation, Universität Bern, Philosophisch-naturwissenschaftlichen Fakultät)

Baur, Michael; Studer, Thomas (April 2020). Semirings of Evidence. In: Dastani, Mehdi; Dong, Huimin; van der Torre, Leon (eds.) Logic and Argumentation. International Conference, CLAR 2020, Proceedings. Lecture Notes in Computer Science: Vol. 12061 (pp. 42-57). Springer 10.1007/978-3-030-44638-3_3

Ghilezan, Silvia; Ivetic, Jelena; Kasterovic, Simona; Ognjanovic, Zoran; Savic, Nenad (3 January 2020). Towards Probabilistic Reasoning in Type Theory - The Intersection Type Case. In: Herzig, Andreas; Kontinen, Juha (eds.) Foundations of Information and Knowledge Systems. Lecture Notes in Computer Science: Vol. 12012 (pp. 122-139). Springer 10.1007/978-3-030-39951-1_8

Lehmann, Eveline; Studer, Thomas (January 2020). Belief Expansion in Subset Models. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science LFCS 2020. Lecture Notes in Computer Science: Vol. 11972 (pp. 85-97). Springer 10.1007/978-3-030-36755-8_6

Kokkinis, Ioannis; Ognjanović, Zoran; Studer, Thomas (2020). Probabilistic justification logic. Journal of logic and computation, 30(1), pp. 257-280. Oxford University Press 10.1093/logcom/exaa011

Studer, Thomas (2020). No-Go Theorems for Data Privacy. In: Proceedings of the 7th International Cryptology and Information Security Conference. Video Conference. 9th-10th June 2020.

Studer, Thomas; Faroldi, Federico; Ghari, Meghdad; Lehmann, Eveline (2020). Impossible and Conflicting Obligations in Justification Logic (Submitted). In: 15th International Conference on Deontic Logic and Normative Systems (DEON 2020). 30.07.2020 – 02.08.2020 (postponed to 2021).

Kokkinis, Ioannis; Savic, Nenad; Studer, Thomas (2020). Justification Logics with Probability Operators. In: Ognjanović, Zoran (ed.) Probabilistic Extensions of Various Logical Systems (pp. 215-234). Springer 10.1007/978-3-030-52954-3_8

Fuchs, Mathias; Riesen, Kaspar (2020). Matching of Matching-Graphs - A Novel Approach for Graph Classification. In: Proceedings of 2020 25th International Conference on Pattern Recognition (ICPR).

Bärtschi, Michael; Jäger, Gerhard Max (2020). Having a look again at some theories of proof-theoretic strengths around Γ₀. In: Kahle, Reinhard; Rathjen, Michael (eds.) The Legacy of Kurt Schütte (pp. 103-128). Cham: Springer 10.1007/978-3-030-49424-7_9

2019

Marinkovic, Bojan; Glavan, Paola; Ognjanovic, Zoran; Studer, Thomas (2019). A temporal epistemic logic with a non-rigid set of agents for analyzing the blockchain protocol. Journal of logic and computation, 29(5), pp. 803-830. Oxford University Press 10.1093/logcom/exz007

Doder, Dragan; Savic, Nenad; Ognjanovic, Zoran (2019). Multi-agent Logics for Reasoning About Higher-Order Upper and Lower Probabilities. Journal of logic, language and information, 29(1), pp. 77-107. Springer Netherlands 10.1007/s10849-019-09301-7

Mohammadi, Hamzeh; Studer, Thomas (September 2019). Bayesian Confirmation and Justifications. Lecture notes in computer science, 11726, pp. 408-418. Springer 10.1007/978-3-030-29765-7_34

Marinkovic, Bojan; Glavan, Paola; Ognjanovic, Zoran; Doder, Dragan; Studer, Thomas (September 2019). Probabilistic Consensus of the Blockchain Protocol. Lecture notes in computer science, 11726, pp. 469-480. Springer 10.1007/978-3-030-29765-7_39

Ranzi, Florian; Strahm, Thomas (2019). A flexible type system for the small Veblen ordinal. Archive for mathematical logic, 58(5-6), pp. 711-751. Springer-Verlag 10.1007/s00153-019-00658-x

Afshari, Bahareh; Jäger, Gerhard Max; Leigh, Graham E. (July 2019). An Infinitary Treatment of Full Mu-Calculus. Lecture notes in computer science, 11541, pp. 17-34. Springer 10.1007/978-3-662-59533-6_2

Lehmann, Eveline; Studer, Thomas (July 2019). Subset models for justification logic. Lecture notes in computer science, 11541, pp. 433-449. Springer 10.1007/978-3-662-59533-6_26

Savic, Nenad; Studer, Thomas (2019). Relevant Justification Logic. Journal of applied logics, 6(2), pp. 397-412. College Publications

Studer, Thomas (March 2019). The Logic of Temporal Domination. In: RIVF 2019. Proceedings (pp. 1-4). IEEE 10.1109/RIVF.2019.8713701

Savic, Nenad; Studer, Thomas (5 February 2019). Public Announcements for Epistemic Models and Hypertheories. In: Khan, Md. Aquil; Manuel, Amaldev (eds.) ICLA 2019 - 8th Indian Conference on Logic and its Applications. Lecture Notes in Computer Science: Vol. 11600 (pp. 64-75). Delhi, India: Springer 10.1007/978-3-662-58771-3_7

Xu, Chao; Wang, Yanjing; Studer, Thomas (2019). A logic of knowing why. Synthese, 198(2), pp. 1259-1285. Springer Netherlands 10.1007/s11229-019-02104-0

Jaun, Lukas (2019). Category Theory in Explicit Mathematics. (Dissertation, Institute of Computer Science, Philosophisch-naturwissenschaftliche Fakultät, Universität Bern)

Jäger, Gerhard; Steila, Silvia (2019). From Mathesis Universalis to fixed points and related set-theoretic concepts. In: Centrone, Stefania; Negri, Sara; Sarikaya, Deniz; Schuster, Peter M. (eds.) Mathesis Universalis, Computability and Proof, Synthese Library. Studies in Epistemology, Logic, Methodology, and Philosophy of Science: Vol. 412 (pp. 113-129). Cham: Springer 10.1007/978-3-030-20447-1_9

2018

Marti, Michel; Metcalfe, George (2018). Expressivity in chain-based modal logics. Archive for mathematical logic, 57(3-4), pp. 361-380. Springer International 10.1007/s00153-017-0573-4

Marti, Michel; Studer, Thomas (2018). The Proof Theory of Common Knowledge. In: Ditmarsch, Hans van; Sandu, Gabriel (eds.) Jaakko Hintikka on Knowledge and Game-Theoretical Semantics. Outstanding Contributions to Logic: Vol. 12 (pp. 433-455). Cham: Springer International Publishing 10.1007/978-3-319-62864-6_18

Oliva, Paulo; Steila, Silvia (2018). A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem. The journal of symbolic logic, 83(1), pp. 70-83. Cambridge University Press 10.1017/jsl.2017.33

Brünnler, Kai; Flumini, Dandolo; Studer, Thomas (2018). A Logic of Blockchain Updates. In: LFCS 2018: Logical Foundations of Computer Science. Lecture Notes in Computer Science: Vol. 10703 (pp. 107-119). Cham: Springer International Publishing 10.1007/978-3-319-72056-2_7

Doder, Dragan; Savic, Nenad; Ognjanović, Zoran (2018). A Decidable Multi-agent Logic with Iterations of Upper and Lower Probability Operators. In: Ferrarotti, Flavio; Woltran, Stefan (eds.) Foundations of Information and Knowledge Systems. Lecture Notes in Computer Science: Vol. 10833 (pp. 170-185). Cham: Springer International Publishing 10.1007/978-3-319-90050-6_10

Ghilezan, Silvia; Ivetić, Jelena; Kašterović, Simona; Ognjanović, Zoran; Savic, Nenad (2018). Probabilistic reasoning about simply typed Lambda terms. In: Logical Foundations of Computer Science. Lecture Notes in Computer Science: Vol. 10703 (pp. 170-189). Cham: Springer International Publishing 10.1007/978-3-319-72056-2_11

Jäger, Gerhard; Steila, Silvia (2018). About some fixed point axioms and related principles in Kripke-Platek environments. The journal of symbolic logic, 83(02), pp. 642-668. Cambridge University Press 10.1017/jsl.2018.12

Rosebrock, Timotej Alexander (2018). Some Models and Semi-decidability Notions of Applicative Theories (Unpublished). (Dissertation, Institut für Informatik und angewandte Mathematik, Philosophisch-naturwissenschaftliche Fakultät)

Jäger, Gerhard; Rosebrock, Timotej Alexander; Sato, Kentaro (2018). Truncation and Semi-Decidability Notions in Applicative Theories. The journal of symbolic logic, 83(03), pp. 967-990. Cambridge University Press 10.1017/jsl.2018.34

Marti, Michel; Studer, Thomas (2018). The Internalized Disjunction Property for Intuitionistic Justification Logic. In: Bezhanishvili, Guram; D'Agostino, Giovanna; Metcalfe, George; Studer, Thomas (eds.) Advances in Modal Logic 12 (pp. 511-529). College Publications

2017

Marti, Michel (2017). Contributions to Intuitionistic Epistemic Logic. (Dissertation, Institute of Computer Science, Philosophisch-naturwissenschaftliche Fakultät, Universität Bern)

Berardi, Stefano; Steila, Silvia (2017). Ramsey's Theorem for Pairs and k Colors as a Sub-Classical Principle of Arithmetic. The journal of symbolic logic, 82(02), pp. 737-753. Cambridge University Press 10.1017/jsl.2016.41

Frittaion, Emanuele; Steila, Silvia; Yokoyama, Keita (2017). The Strength of the SCT Criterion. In: Gopal, T.V.; Jäger, Gerhard; Steila, Silvia (eds.) Theory and Applications of Models of Computation - 14th Annual Conference, {TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. Lecture Notes in Computer Science: Vol. 10185 (pp. 260-273). Cham: Springer International Publishing 10.1007/978-3-319-55911-7_19

Gopal, T.V.; Jäger, Gerhard; Steila, Silvia (eds.) (2017). Theory and Applications of Models of Computation TAMC 2017. Lecture Notes in Computer Science: Vol. 10185. Cham: Springer International Publishing 10.1007/978-3-319-55911-7

Savic, Nenad; Doder, Dragan; Ognjanović, Zoran (2017). A First-Order Logic for Reasoning About Higher-Order Upper and Lower Probabilities. In: Antonucci, A.; Cholvy, L.; Papini, O. (eds.) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. Lecture Notes in Computer Science: Vol. 10369 (pp. 491-500). Cham: Springer International Publishing 10.1007/978-3-319-61581-3_44

Savic, Nenad; Doder, Dragan; Ognjanović, Zoran (2017). Logics with lower and upper probability operators. International journal of approximate reasoning, 88, pp. 148-168. Elsevier 10.1016/j.ijar.2017.05.013

Probst, Dieter (2017). A modular ordinal analysis of metapredicative subsystems of second order arithmetic. (Habilitation, Institute of Computer Science, Philosophisch-naturwissenschaftliche Fakultät, Universität Bern)

Ognjanović, Zoran; Savic, Nenad; Studer, Thomas (2017). Justification Logic with Approximate Conditional Probabilities. In: LORI 2017: Logic, Rationality, and Interaction. Lecture Notes in Computer Science: Vol. 10455 (pp. 681-686). Berlin, Heidelberg: Springer Berlin Heidelberg 10.1007/978-3-662-55665-8_52

Audrito, Giorgio; Steila, Silvia (2017). Generic Large Cardinals and Systems of Filters. The journal of symbolic logic, 82(03), pp. 860-892. Cambridge University Press 10.1017/jsl.2017.27

Jäger, Gerhard; Sieg, Wilfried (eds.) (2017). Feferman on Foundations - Logic, Mathematics, Philosophy. Outstanding Contributions to Logic: Vol. 13. Cham: Springer International Publishing 10.1007/978-3-319-63334-3

Jäger, Gerhard (2017). The Operational Penumbra: Some Ontological Aspects. In: Feferman on Foundations 13 (pp. 253-283). Cham: Springer International Publishing 10.1007/978-3-319-63334-3_10

Strahm, Thomas Adrian (2017). Unfolding Schematic Systems. In: Feferman on Foundations. Outstanding Contributions to Logic: Vol. 13 (pp. 187-208). Cham: Springer International Publishing 10.1007/978-3-319-63334-3_8

2016

Jäger, Gerhard (2016). Relativizing operational set theory. The Bulletin of Symbolic Logic, 22(03), pp. 332-352. Cambridge University Press 10.1017/bsl.2016.11

Kokkinis, Ioannis; Studer, Thomas (2016). Cyclic Proofs for Linear Temporal Logic. In: Probst, Dieter; Schuster, Peter (eds.) Concepts of Proof in Mathematics, Philosophy, and Computer Science. Ontos Mathematical Logic: Vol. 6 (pp. 171-192). De Gruyter 10.1515/9781501502620-011

Kokkinis, Ioannis (2016). Uncertain Reasoning in Justification Logic. (Dissertation, Institute of Computer Science, Philosophisch-naturwissenschaftliche Fakultät, Universität Bern)

Buchholtz, Ulrik Torben; Jäger, Gerhard; Strahm, Thomas Adrian (2016). Theories of proof-theoretic strength ψ(ΓΩ+1). In: Probst, Dieter; Schuster, Peter (eds.) Concepts of Proof in Mathematics, Philosophy, and ComputerScience. Ontos Mathematical Logic: Vol. 6 (pp. 115-140). De Gruyter 10.1515/9781501502620-007

Jäger, Gerhard; Marti, Michel (2016). Intuitionistic common knowledge or belief. Journal of applied logic, 18, pp. 150-163. Elsevier 10.1016/j.jal.2016.04.004

Kokkinis, Ioannis (2016). The Complexity of Non-Iterated Probabilistic Justification Logic. In: Gyssens, Marc; Simari, Guillermo (eds.) Foundations of Information and Knowledge Systems - 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings. Lecture Notes in Computer Science: Vol. 9616 (pp. 292-310). Cham: Springer 10.1007/978-3-319-30024-5_16

Kokkinis, Ioannis; Ognjanović, Zoran; Studer, Thomas (2016). Probabilistic Justification Logic. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings. Lecture Notes in Computer Science: Vol. 9537 (pp. 174-186). Cham: Springer 10.1007/978-3-319-27683-0_13

Studer, Thomas (2016). Relationale Datenbanken: von den theoretischen Grundlagen zu Anwendungen mit PostgreSQL [Textbook] . eXamen.press. Berlin, Heidelberg: Springer Berlin Heidelberg 10.1007/978-3-662-46571-4

Kahle, Reinhard; Strahm, Thomas Adrian; Studer, Thomas (eds.) (2016). Advances in Proof Theory. Progress in Computer Science and Applied Logic: Vol. 28. Cham: Springer International Publishing 10.1007/978-3-319-29198-7

Probst, Dieter; Schuster, Peter (eds.) (2016). Concepts of Proof in Mathematics, Philosophy, and Computer Science. Ontos Mathematical Logic: Vol. 6. De Gruyter 10.1515/9781501502620

Steila, Silvia; Yokoyama, Keita (2016). Reverse mathematical bounds for the Termination Theorem. Annals of pure and applied logic, 167(12), pp. 1213-1241. Elsevier 10.1016/j.apal.2016.06.001

Kuznets, Roman; Studer, Thomas (2016). Weak arithmetical interpretations for the Logic of Proofs. Logic Journal of IGPL, 24(3), pp. 424-440. Oxford University Press 10.1093/jigpal/jzw002

Kashev, Alexander (2016). Justification with nominals. (Dissertation, Institut für Informatik und angewandte Mathematik, Philosophisch-naturwissenschaftliche Fakultät)

Jäger, Gerhard; Marti, Michel (2016). A canonical model construction for intuitionistic distributed knowledge. In: Beklemishev, Lev; Demri, Stéphane; Máté, András (eds.) Advances in Modal Logic. Advances in Modal Logic 2016: Vol. 11 (pp. 420-434). College Publications

Marti, Michel; Studer, Thomas (2016). Intuitionistic modal logic made explicit. The IfCoLog Journal of Logics and their Applications, 3(5), pp. 877-901. College Publications

2015

Eberhard, Sebastian (2015). Applicative theories for logarithmic complexity classes. Theoretical Computer Science, 585, pp. 115-135. Elsevier 10.1016/j.tcs.2015.03.007

Kokkinis, Ioannis; Maksimović, Petar; Ognjanović, Zoran; Studer, Thomas (2015). First steps towards probabilistic justification logic. Logic Journal of IGPL, 23(4), pp. 662-687. Oxford University Press 10.1093/jigpal/jzv025

Werner, Johannes Martin (2015). Controlled Query Evaluation in General Semantics with Incomplete Information. (Dissertation, Institut für Informatik und angewandte Mathematik, Philosophisch-naturwissenschaftliche Fakultät)

Fitting, Melvin; Kuznets, Roman (2015). Modal interpolation via nested sequents. Annals of pure and applied logic, 166(3), pp. 274-305. Elsevier 10.1016/j.apal.2014.11.002

Sato, Kentaro (2015). Full and hat inductive definitions are equivalent in NBG. Archive for mathematical logic, 54(1-2), pp. 75-112. Springer International 10.1007/s00153-014-0403-x

Sato, Kentaro; Zumbrunnen, Rico (2015). A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π1-equivalent to KP. Annals of pure and applied logic, 166(2), pp. 121-186. Elsevier 10.1016/j.apal.2014.10.001

Sato, Kentaro (2015). A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T0. Annals of pure and applied logic, 166(7-8), pp. 800-835. Elsevier 10.1016/j.apal.2015.04.002

Eberhard, Sebastian; Strahm, Thomas Adrian (2015). Unfolding Feasible Arithmetic and Weak Truth. In: Achourioti, Theodora; Galinon, Henri; Martínez Fernández, José; Fujimoto, Kentaro (eds.) Unifying the Philosophy of Truth. Logic, Epistemology, and the Unity of Science: Vol. 36 (pp. 153-167). Dordrecht: Springer Netherlands 10.1007/978-94-017-9673-6_7

Ranzi, Florian (2015). From a Flexible Type System to Metapredicative Wellordering Proofs. (Dissertation, Institut für Informatik und angewandte Mathematik, Philosophisch-naturwissenschaftliche Fakultät)

Jäger, Gerhard; Probst, Dieter (2015). A Proof-Theoretic Analysis of Theories for Stratified Inductive Definitions. In: Kahle, Reinhard; Rathjen, Michael (eds.) Gentzen's Centenary - The Quest for Consistency (pp. 425-454). Springer 10.1007/978-3-319-10103-3_15

Strahm, Thomas Adrian; Sommaruga, Giovanni (eds.) (2015). Turing's Revolution: The Impact of His Ideas about Computability. Birkhäuser Basel 10.1007/978-3-319-22156-4

2014

Metcalfe, George; Marti, Michel (2014). A Hennessy-Milner Property for Many-Valued Modal Logics. In: Goré, Rajeev; Kooi, Barteld; Kurucz, Agi (eds.) Advances in Modal Logic. Advances in Modal Logic: Vol. 10 (pp. 407-420). London: College Publications

Sato, Kentaro (2014). Relative Predicativity and dependent recursion in second-order set theory and higher-orders theories. The journal of symbolic logic, 79(03), pp. 712-732. Cambridge University Press 10.1017/jsl.2014.28

Alberucci, Luca; Krähenbühl, Jürg; Studer, Thomas (2014). Justifying induction on modal μ-formulae. Logic Journal of IGPL, 22(6), pp. 805-817. Oxford University Press 10.1093/jigpal/jzu001

Flumini, Dandolo; Sato, Kentaro (2014). From hierarchies to well-foundedness. Archive for mathematical logic, 53(7-8), pp. 855-863. Springer International 10.1007/s00153-014-0392-9

Sato, Kentaro (2014). Forcing for hat inductive definitions in arithmetic. Mathematical logic quarterly, 60(4-5), pp. 314-318. Wiley-VCH 10.1002/malq.201300044

Jäger, Gerhard; Zumbrunnen, Rico (2014). Explicit mathematics and operational set theory: some ontological comparisons. The Bulletin of Symbolic Logic, 20(03), pp. 275-292. Cambridge University Press 10.1017/bsl.2014.21

Ranzi, Florian; Strahm, Thomas Adrian (2014). A note on the theory SID<ω of stratified induction. Mathematical Logic Quarterly, 60(6), pp. 487-497. 10.1002/malq.201300063

Eberhard, Sebastian (2014). A feasible theory of truth over combinatory algebra. Annals of pure and applied logic, 165(5), pp. 1009-1033. Elsevier 10.1016/j.apal.2013.12.002

Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2014). Realizing public announcements by justifications. Journal of computer and system sciences, 80(6), pp. 1046-1066. Elsevier 10.1016/j.jcss.2014.04.001

Savateev, Yury (2014). Proof internalization in generalized Frege systems for classical logic. Annals of pure and applied logic, 165(1), pp. 340-356. Elsevier 10.1016/j.apal.2013.07.017

Artemov, Sergei N.; Kuznets, Roman (2014). Logical omniscience as infeasibility. Annals of pure and applied logic, 165(1), pp. 6-25. Elsevier 10.1016/j.apal.2013.07.003

Studer, Thomas; Werner, Johannes Martin (2014). Censors for Boolean Description Logic. Transactions on Data Privacy, 7(3), pp. 223-252.

2013

McKinley, Richard (2013). Canonical proof nets for classical logic. Annals of pure and applied logic, 164(6), pp. 702-732. Elsevier 10.1016/j.apal.2012.05.007

McKinley, Richard (2013). Proof Nets for Herbrand’s Theorem. ACM transactions on computational logic, 14(1), pp. 1-31. New York: ACM 10.1145/2422085.2422090

Studer, Thomas (2013). Decidability for some justification logics with negative introspection. The journal of symbolic logic, 78(2), pp. 388-402. Cambridge University Press 10.2178/jsl.7802030

Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2013). Decidability for Justification Logics Revisited. In: Logic, language, and computation. Lecture Notes in Computer Science: Vol. 7758 (pp. 166-181). Berlin, Heidelberg: Springer Berlin Heidelberg 10.1007/978-3-642-36976-6_12

Jäger, Gerhard (2013). Operational closure and stability. Annals of pure and applied logic, 164(7-8), pp. 813-821. Elsevier 10.1016/j.apal.2013.01.004

Kuznets, Roman; Studer, Thomas (2013). Update as Evidence: Belief Expansion. In: Update as evidence: brief expansion. Lecture Notes in Computer Science: Vol. 7734 (pp. 266-279). Berlin, Heidelberg: Springer 10.1007/978-3-642-35722-0_19

Studer, Thomas (2013). A Universal Approach to Guarantee Data Privacy. Logica universalis, 7(2), pp. 195-209. Birkhäuser 10.1007/s11787-012-0060-y

2012

Brünnler, Kai; Studer, Thomas (2012). Syntactic cut-elimination for a fragment of the modal mu-calculus. Annals of pure and applied logic, 163(12), pp. 1838-1853. Amsterdam: Elsevier 10.1016/j.apal.2012.04.006

Bucheli, Samuel (2012). Justification Logics with Common Knowledge.

Goetschi, Remo (2012). On the Realization and Classification of Justification Logics.

Eberhard, Sebastian; Strahm, Thomas (2012). Weak theories of truth and explicit mathematics. In: Berger, Ulrich; Diener, Hannes; Schuster, Peter (eds.) Logic, Construction, Computation (pp. 157-184). Heusenstamm bei Frankfurt: Ontos

Goetschi, Remo; Kuznets, Roman (2012). Realization for justification logics via nested sequents: Modularity through embedding. Annals of pure and applied logic, 163(9), pp. 1271-1298. Amsterdam: Elsevier 10.1016/j.apal.2012.02.002

Jäger, Gerhard; Zumbrunnen, Rico (2012). About the Strength of Operational Regularity. In: Berger, Ulrich; Diener, Hannes; Schuster, Peter (eds.) Logic, Construction, Computation (pp. 305-324). Heusenstamm bei Frankfurt: Ontos

Buss, Samuel R.; Kuznets, Roman (2012). Lower complexity bounds in justification logic. Annals of pure and applied logic, 163(7), pp. 888-905. Amsterdam: Elsevier 10.1016/j.apal.2011.09.010

Kuznets, Roman; Studer, Thomas (2012). Justifications, Ontology, and Conservativity. In: Bolander, Thmas; Braüner, Torben; Ghilardi, Silvio; Moss, Lawrence (eds.) Advances in Modal Logic, volume 9 (pp. 437-458). College Publications

Savateev, Yury (2012). Product-free Lambek calculus is NP-complete. Annals of pure and applied logic, 163(7), pp. 775-788. Amsterdam: Elsevier 10.1016/j.apal.2011.09.017

Studer, Thomas (2012). Justified Terminological Reasoning. In: Clarke, Edmund; Virbitskaite, Irina; Voronkov, Andrei (eds.) Perspectives of Systems Informatics. 8th International Andrei Ershov Memorial Conference, PSI 2011, Novosibirsk, Russia, June 27-July 1, 2011 7162 (pp. 349-361). Heidelberg: Springer Verlag 10.1007/978-3-642-29709-0_30

Mints, Grigori; Studer, Thomas (2012). Cut-elimination for the mu-calculus with one variable. In: D. Miller, D.; Esik, Z. (eds.) Fixed Points in Computer Science 2012.

2011

Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2011). Justifications for Common Knowledge. Journal of applied non-classical logics, 21(1), pp. 35-60. Paris: Ed. Hermes 10.3166/JANCL.21.35-60

Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2011). Partial Realization in Dynamic Justification Logic. In: Beklemishev, Lev D.; de Queiroz, Ruy (eds.) Logic, Language, Information and Computation, 18th International workshop, WoLLIC 2011, Philadelphia, PA, USA, May, 18-20, Proceedings. Lecture Notes in Computer Science: Vol. 6642 (pp. 35-51). Heidelberg: Springer Verlag 10.1007/978-3-642-20920-8_9

Jäger, Gerhard; Studer, Thomas (2011). A Buchholz rule for modal fixed point logics. Logica universalis, 5(1), pp. 1-19. Basel: Birkhäuser 10.1007/s11787-010-0022-1

Jäger, Gerhard; Probst, Dieter (2011). The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories. Annals of pure and applied logic, 162(8), pp. 647-660. Amsterdam: Elsevier 10.1016/j.apal.2011.01.009

Probst, Dieter (2011). The provably terminating operations of the subsystem (PETJ) of explicit mathematics. Annals of pure and applied logic, 162(11), pp. 934-947. Amsterdam: Elsevier 10.1016/j.apal.2011.04.004

Probst, Dieter; Strahm, Thomas (2011). Admissible closures of polynomial time computable arithmetic. Archive for mathematical logic, 50(5-6), pp. 643-660. Berlin: Springer-Verlag 10.1007/s00153-011-0238-7

Spescha, Daria; Strahm, Thomas (2011). Realizability in weak systems of explicit mathematics. Mathematical logic quarterly, 57(6), pp. 551-565. Weinheim: Wiley-VCH

Studer, Thomas (2011). Justification Logic, Inference Tracking, and Data Privacy. Logic and logical philosophy, 20(4), pp. 297-306. Toruń (PL): Nicholas Copernicus Univ. Press

Studer, Thomas (2011). An application of justification logic to protocol verification. In: Proceedings of Computational Intelligence and Security CIS 2011.

2010

Brünnler, Kai; Goetschi, Remo; Kuznets, Roman (2010). A syntactic realization theorem for justification logics. In: Beklemishev, Lev; Goranko, Valentin; Shehtman, Valentin (eds.) Advances in modal logic, volume 8 (pp. 39-58). College Publications

Bucheli, Samuel; Kuznets, Roman; Renne, Bryan; Sack, Joshua; Studer, Thomas (2010). Justified Belief Change. In: Arrazola, Xabier; Ponte, Maria (eds.) Proceedings of the Second ILCLI International Workshop on Logic and Philosphy of Knowledge, Communication and Action (LogKCA-10).

Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2010). Two ways to common knowledge. In: Bolander, Thomas; Braüner, Torben (eds.) Proceedings of the 6th workshop on Methods for Modalities (M4M-6 2009), Copenhagen, Denmark, 12-14 November 2009. Electronic Notes in Theoretical Computer Science: Vol. 262 (pp. 83-98). Amsterdam: Elsevier 10.1016/j.entcs.2010.04.007

Jäger, Gerhard; Krähenbühl, Jürg (2010). Choice in a Theory of sets and classes. In: Schindler, Ralf (ed.) Ways of Proof Theory. Ontos mathematical logic: Vol. 2 (pp. 283-314). Heusenstamm bei Frankfurt: Ontos

Jäger, Gerhard (2010). Modal Fixed Point Logics. In: Esparza, Javier; Spanfelner, Bernd; Grumberg, Orna (eds.) Logics and Languages for Reliability and Security. NATO Science for Peace and Security Series. D: Information and Communication Security: Vol. 25 (pp. 129-154). IOS Press 10.3233/978-1-60750-100-8-129

Spescha, Daria; Strahm, Thomas (2010). Realisability in weak systems of explicit mathematics. Mathematical logic quarterly, 57(6), pp. 551-565. Weinheim: Wiley-VCH 10.1002/malq.201020064

Feferman, Solomon; Strahm, Thomas (2010). Unfolding finitist arithmetic. Review of symbolic logic, 3(4), pp. 665-689. Cambridge, Mass.: Cambridge University Press 10.1017/S1755020310000183

Studer, Thomas (2010). Privacy Preserving Modules for Ontologies. In: Pnueli, A.; Virbitskaite, I.; Voronkov, A. (eds.) Proceedings of Perspectives of System Informatics PSI '09. Lecture Notes in Computer Science: Vol. 5947 (pp. 380-387). Heidelberg: Springer Verlag

McKinley, Richard (2010). Expansion nets: Proof nets for propositional classical logic. In: Fermüller, Christian; Voronkov, Andrei (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings 6397 (pp. 535-549). Heidelberg: Springer Verlag 10.1007/978-3-642-16242-8

Kuznets, Roman (2010). Self-Referential Justifications in Epistemic Logic. Theory of computing systems, 46(4), pp. 636-661. New York, N.Y.: Springer-Verlag 10.1007/s00224-009-9209-3

2009

Alberucci, Luca (2009). Sequent calculi for the modal mu-calculus over S5. Journal of logic and computation, 19(6), pp. 971-985. Oxford: Oxford University Press 10.1093/logcom/exn106

Alberucci, Luca; Facchini, Alessandro (2009). On Modal mu-Calculus and Gödel-Löb Logic. Studia logica, 91(2), pp. 145-169. Dordrecht: Springer Netherlands 10.1007/s11225-009-9170-9

Alberucci, Luca; Facchini, Alessandro (2009). The modal mu-calculus hierarchy over restricted classes of transition systems. The journal of symbolic logic, 74(4), pp. 1367-1400. Champaign, Ill.: Cambridge University Press 10.2178/jsl/1254748696

Studer, Thomas (2009). Common knowledge does not have the Beth property. Information processing letters, 109(12), 611--614. Amsterdam: Elsevier 10.1016/j.ipl.2009.02.011

Brünnler, Kai; Studer, Thomas (2009). Syntactic cut-elimination for common knowledge. Annals of pure and applied logic, 160(1), pp. 82-95. Amsterdam: Elsevier 10.1016/j.apal.2009.01.014

Stouppa, Phiniki; Studer, Thomas (2009). Data Privacy for ALC Knowledge Bases. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science. International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5407 (pp. 409-421). Heidelberg: Springer Verlag 10.1007/978-3-540-92687-0_28

Brünnler, Kai; Studer, Thomas (2009). Syntactic cut-elimination for common knowledge. In: Areces, C.; Demri, S. (eds.) Proceedings of the 5th Workshop on Methods for Modalities (M4M5 2007). Electronic Notes in Theoretical Computer Science: Vol. 231 (pp. 227-240). Amsterdam: Elsevier 10.1016/j.entcs.2009.02.038

Jäger, Gerhard (2009). Full operational set theory with unbounded existential quantification and power set. Annals of pure and applied logic, 160(1), pp. 33-52. Amsterdam: Elsevier 10.1016/j.apal.2009.01.010

Brünnler, Kai; Strassburger, Lutz (2009). Modular Sequent Systems for Modal Logic. In: Giese, Martin; Waaler, Arild (eds.) Automated Reasoning with Analytic Tableaux and Related Methods. 18th International Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5607 (pp. 152-166). Heidelberg: Springer Verlag 10.1007/978-3-642-02716-1_12

Brünnler, Kai (2009). Deep Sequent Systems for Modal Logic. Archive for mathematical logic, 48(6), pp. 551-577. Berlin: Springer International 10.1007/s00153-009-0137-3

Buss, Samuel R.; Kuznets, Roman (2009). The NP-Completeness of Reflected Fragments of Justification Logics. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings. Lecture Notes in Computer Science: Vol. 5407 (pp. 122-136). Heidelberg: Springer Verlag 10.1007/978-3-540-92687-0_9

Artemov, Sergei; Kuznets, Roman (2009). Logical omniscience as a computational complexity problem. In: Heifetz, Aviad (ed.) TARK '09. Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (pp. 14-23). New York: Association for Computing Machinery ACM 10.1145/1562814.1562821

Kuznets, Roman (2009). A Note on the Use of Sum in the Logic of Proofs. In: Drossos, Costas; , ; , ; Tsinakis, Constantine (eds.) Proceedings of the 7th Panhellenic Logic Symposium (pp. 99-103). Patras University Press

Bucheli, Samuel; Kuznets, Roman; Studer, Thomas (2009). Two Ways to Common Knowledge. In: Preliminary proceedings of the 6th Workshop on Methods for Modalities (2009 M4M-6). Computer Science Research Reports: Vol. 128 (pp. 73-87). Roskilde University

McKinley, Richard (2009). The alpha-epsilon calculus. In: Proceedings of Workshop on Structures and Deduction.

Spescha, Daria; Strahm, Thomas (2009). Elementary explicit types and polynomial time operations. Mathematical logic quarterly, 55(3), pp. 245-258. Weinheim: Wiley-VCH 10.1002/malq.200810004

Jäger, Gerhard (2009). Operations, sets and classes. In: 13th International Congress of Logic, Methodology and Philosophy of Science (pp. 74-96). London: College Publications

2008

Studer, Thomas (2008). On the proof theory of the modal mu-calculus. Studia logica, 89(3), pp. 343-363. Dordrecht: Springer Netherlands 10.1007/s11225-008-9133-6

Jäger, Gerhard; Kretz, Mathis; Studer, Thomas (2008). Canonical completeness of infinitary mu. Journal of logic and algebraic programming, 76(2), pp. 270-292. New York, N.Y.: North-Holland 10.1016/j.jlap.2008.02.005

Brünnler, Kai; Probst, Dieter; Studer, Thomas (2008). On contraction and the modal fragment. Mathematical logic quarterly, 54(4), pp. 345-349. Weinheim: Wiley-VCH 10.1002/malq.200710043

Brünnler, Kai; McKinley, Richard (2008). An Algorithmic Interpretation of a Deep Inference System. In: Cervesato, Iliano; Veith, Helmut; Voronkov, Andrei (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings. Lecture Notes in Computer Science: Vol. 5330 (pp. 482-496). Heidelberg: Springer Verlag 10.1007/978-3-540-89439-1_34

Kuznets, Roman (2008). Self-referentiality of Justified Knowledge. In: Hirsch, Edward A.; Razborov, Alexander A.; Semenov, Alexei; Slissenko, Anatol (eds.) Computer Science - Theory and ApplicationsThird International Computer Science Symposium in Russia, CSR 2008 Moscow, Russia, June 7-12, 2008. Proceedings. Lecture Notes in Computer Science: Vol. 5010 (pp. 228-239). Heidelberg: Springer Verlag 10.1007/978-3-540-79709-8_24

McKinley, Richard (2008). Soft linear set theory. Journal of logic and algebraic programming, 76(2), pp. 226-245. New York, N.Y.: North-Holland 10.1016/j.jlap.2008.02.010

Strahm, Thomas; Zucker, Jeffery (2008). Primitive recursive selection functions for existential assertions over abstract algebras. Journal of logic and algebraic programming, 76(2), pp. 175-197. New York, N.Y.: North-Holland 10.1016/j.jlap.2008.02.002

Strahm, Thomas (ed.) (2008). Dialectica. Special Issue: Gödel's dialectica Interpretation, 62(2). John Wiley & Sons 10.1111/j.1746-8361.2008.01135.x

2007

Jäger, Gerhard (2007). On Feferma's operational set theory. Annals of pure and applied logic, 150(1-3), pp. 19-39. Amsterdam: Elsevier 10.1016/j.apal.2007.09.001

Jäger, Gerhard; Kretz, Mathis; Studer, Thomas (2007). Cut-free common knowledge. Journal of applied logic, 5(4), pp. 681-689. Amsterdam: Elsevier 10.1016/j.jal.2006.02.003

Kottmann, Norbert; Studer, Thomas (2007). Improving semantic query answering. In: Database and Expert Systems Applications. Proceedings of the18th International Conference, DEXA 2007. Lecture Notes in Computer Science: Vol. 4653 (pp. 671-679). Heidelberg: Springer Verlag 10.1007/978-3-540-74469-6_65

Steiner, David; Studer, Thomas (2007). Total public announcements. In: Logical Foundations of Computer Science. Proceedings of the International Symposium, LFCS 2007. Lecture Notes in Computer Science: Vol. 4514 (pp. 498-511). Heidelberg: Springer Verlag 10.1007/978-3-540-72734-7_35

Stouppa, Phiniki (2007). A deep inference system for the modal logic S5. Studia logica, 85(2), pp. 199-214. Dordrecht: Kluwer Academic Publishers 10.1007/s11225-007-9028-y

Stouppa, Phiniki; Studer, Thomas (2007). A formal model of data privacy. In: Virbitskaite, Irina; Voronkov, Andrei (eds.) Perspectives of Systems Informatics. 6th International Andrei Ershov Memorial Conference, PSI 2006, Novosibirsk, Russia, June 27-30, 2006. Revised Papers. Theoretical Computer Science and General Issues: Vol. 4378 (pp. 400-408). Heidelberg: Springer Verlag 10.1007/978-3-540-70881-0_34

2006

Brünnler, Kai (2006). Cut elimination inside a deep inference system for classical predicate logic. Studia logica, 82(1), pp. 51-71. Dordrecht: Springer Science + Business Media 10.1007/s11225-006-6605-4

Kretz, Mathis; Studer, Thomas (2006). Deduction chains for common knowledge. Journal of applied logic, 4(3), pp. 331-357. Amsterdam: Elsevier

Steiner, David (2006). A system for consistency preserving belief change. In: Artemov, Sergei; Parikh, Rohit (eds.) Proceedings of Rationality and Knowledge. 18th European Summer School of Logic, Language and Information (pp. 133-144). Nancy: Association for Logic, Language and Information

Steiner, David; Strahm, Thomas (2006). On the proof theory of type two functionals based on primitive recursive operations. Mathematical logic quarterly, 52(3), pp. 237-252. Weinheim: Wiley-VCH 10.1002/malq.200510029

Brünnler, Kai (2006). Deep Sequent Systems for Modal Logic. In: Governatori, Guido; Hodkinson, Ian; Venema, Yde (eds.) Advances in Modal Logic. Volume 6 (pp. 107-119). College Publications

Brünnler, Kai (2006). Deep inference and its normal form of derivations. In: Beckmann, Arnold; Berger, Ulrich; Löwe, Benedikt; Tucker, John V. (eds.) Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, July 2006, Proceedings. Lecture Notes in Computer Science: Vol. 3988 (pp. 65-74). Heidelberg: Springer Verlag 10.1007/11780342_7

Probst, Dieter (2006). The proof-theoretic analysis of transfinitely iterated quasi least fixed points. The journal of symbolic logic, 71(3), pp. 721-746. Champaign, Ill.: Cambridge University Press 10.2178/jsl/1154698573