Остановите войну!
for scientists:
default search action
Thomas Studer
- > Home > Persons > Thomas Studer
Publications
- 2023
- [c36]Federico L. G. Faroldi, Atefeh Rohani, Thomas Studer:
Conditional Obligations in Justification Logic. WoLLIC 2023: 178-193 - [i10]Federico L. G. Faroldi, Meghdad Ghari, Eveline Lehmann, Thomas Studer:
Impossible and Conflicting Obligations in Justification Logic. CoRR abs/2309.15763 (2023) - [i9]Eveline Lehmann, Thomas Studer:
Belief Expansion in Subset Models. CoRR abs/2310.03627 (2023) - 2021
- [c33]Atefeh Rohani, Thomas Studer:
Explicit Non-normal Modal Logic. WoLLIC 2021: 64-81 - [i7]Atefeh Rohani, Thomas Studer:
Explicit non-normal modal logic. CoRR abs/2108.04486 (2021) - 2020
- [j27]Kai Brünnler, Dandolo Flumini, Thomas Studer:
A logic of blockchain updates. J. Log. Comput. 30(8): 1469-1485 (2020) - [c30]Eveline Lehmann, Thomas Studer:
Belief Expansion in Subset Models. LFCS 2020: 85-97 - 2019
- [c24]Eveline Lehmann, Thomas Studer:
Subset Models for Justification Logic. WoLLIC 2019: 433-449 - 2018
- [c23]Michel Marti, Thomas Studer:
The Internalized Disjunction Property for Intuitionistic Justification Logic. Advances in Modal Logic 2018: 511-529 - [c22]Kai Brünnler, Dandolo Flumini, Thomas Studer:
A Logic of Blockchain Updates. LFCS 2018: 107-119 - [e1]Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe, Thomas Studer:
Advances in Modal Logic 12, proceedings of the 12th conference on "Advances in Modal Logic," held in Bern, Switzerland, August 27-31, 2018. College Publications 2018, ISBN 978-1-84890-255-8 [contents] - 2017
- [c20]Samuel Bucheli, Meghdad Ghari, Thomas Studer:
Temporal Justification Logic. M4M@ICLA 2017: 59-74 - [i4]Kai Brünnler, Dandolo Flumini, Thomas Studer:
A Logic of Blockchain Updates. CoRR abs/1707.01766 (2017) - 2016
- [j24]Michel Marti, Thomas Studer:
Intuitionistic Modal Logic made Explicit. FLAP 3(5): 877-902 (2016) - [j23]Roman Kuznets, Thomas Studer:
Weak arithmetical interpretations for the Logic of Proofs. Log. J. IGPL 24(3): 424-440 (2016) - [i3]Michel Marti, Thomas Studer:
Modular Models for Intuitionistic Justification Logic. CoRR abs/1604.07181 (2016) - 2014
- [j21]Luca Alberucci, Jürg Krähenbühl, Thomas Studer:
Justifying induction on modal μ-formulae. Log. J. IGPL 22(6): 805-817 (2014) - [j20]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Realizing public announcements by justifications. J. Comput. Syst. Sci. 80(6): 1046-1066 (2014) - 2013
- [c18]Roman Kuznets, Thomas Studer:
Update as Evidence: Belief Expansion. LFCS 2013: 266-279 - 2012
- [j16]Kai Brünnler, Thomas Studer:
Syntactic cut-elimination for a fragment of the modal mu-calculus. Ann. Pure Appl. Log. 163(12): 1838-1853 (2012) - [c17]Roman Kuznets, Thomas Studer:
Justifications, Ontology, and Conservativity. Advances in Modal Logic 2012: 437-458 - 2011
- [j15]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Justifications for common knowledge. J. Appl. Non Class. Logics 21(1): 35-60 (2011) - [j14]Gerhard Jäger, Thomas Studer:
A Buchholz Rule for Modal Fixed Point Logics. Logica Universalis 5(1): 1-19 (2011) - [c13]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Decidability for Justification Logics Revisited. TbiLLC 2011: 166-181 - [c12]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Partial Realization in Dynamic Justification Logic. WoLLIC 2011: 35-51 - 2010
- [i1]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Explicit Evidence Systems with Common Knowledge. CoRR abs/1005.0484 (2010) - 2009
- [j13]Kai Brünnler, Thomas Studer:
Syntactic cut-elimination for common knowledge. Ann. Pure Appl. Log. 160(1): 82-95 (2009) - [c9]Samuel Bucheli, Roman Kuznets, Thomas Studer:
Two Ways to Common Knowledge. M4M 2009: 83-98 - 2008
- [j11]Gerhard Jäger, Mathis Kretz, Thomas Studer:
Canonical completeness of infinitary mu. J. Log. Algebraic Methods Program. 76(2): 270-292 (2008) - [j10]Kai Brünnler, Dieter Probst, Thomas Studer:
On contraction and the modal fragment. Math. Log. Q. 54(4): 345-349 (2008) - 2007
- [j8]Gerhard Jäger, Mathis Kretz, Thomas Studer:
Cut-free common knowledge. J. Appl. Log. 5(4): 681-689 (2007) - [c6]Kai Brünnler, Thomas Studer:
Syntactic Cut-elimination for Common Knowledge. M4M 2007: 227-240 - 2006
- [j7]Mathis Kretz, Thomas Studer:
Deduction chains for common knowledge. J. Appl. Log. 4(3): 331-357 (2006) - 2002
- [j5]Gerhard Jäger, Thomas Studer:
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms. Ann. Pure Appl. Log. 114(1-3): 79-101 (2002) - 2001
- [j4]Gerhard Jäger, Reinhard Kahle, Thomas Studer:
Universes in explicit mathematics. Ann. Pure Appl. Log. 109(3): 141-162 (2001) - [j3]Reinhard Kahle, Thomas Studer:
Formalizing non-termination of recursive programs. J. Log. Algebraic Methods Program. 49(1-2): 1-14 (2001) - [j1]Dieter Probst, Thomas Studer:
How to normalize the Jay. Theor. Comput. Sci. 254(1-2): 677-681 (2001) - 2000
- [c1]Reinhard Kahle, Thomas Studer:
A Theory of Explicit Mathematics Equivalent to ID1. CSL 2000: 356-370
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-01-17 20:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint