default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKai Brünnler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j9]Kai Brünnler, Dandolo Flumini, Thomas Studer
:
A logic of blockchain updates. J. Log. Comput. 30(8): 1469-1485 (2020)- [c11]Ramon Boss, Kai Brünnler, Anna Doukmak:
Towards Verifying the Bitcoin-S Library (Short Paper). FMBC@CAV 2020: 8:1-8:9
2010 – 2019
- 2018
- [c10]Kai Brünnler, Dandolo Flumini, Thomas Studer:
A Logic of Blockchain Updates. LFCS 2018: 107-119 - 2017
- [i2]Kai Brünnler, Dandolo Flumini, Thomas Studer:
A Logic of Blockchain Updates. CoRR abs/1707.01766 (2017) - 2012
- [j8]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) - 2011
- [e1]Kai Brünnler, George Metcalfe:
Automated Reasoning with Analytic Tableaux and Related Methods - 20th International Conference, TABLEAUX 2011, Bern, Switzerland, July 4-8, 2011. Proceedings. Lecture Notes in Computer Science 6793, Springer 2011, ISBN 978-3-642-22118-7 [contents] - 2010
- [c9]Kai Brünnler, Remo Goetschi, Roman Kuznets:
A Syntactic Realization Theorem for Justification Logics. Advances in Modal Logic 2010: 39-58 - [c8]Kai Brünnler:
How to Universally Close the Existential Rule. LPAR (Yogyakarta) 2010: 172-186 - [i1]Kai Brünnler:
Nested Sequents. CoRR abs/1004.1845 (2010)
2000 – 2009
- 2009
- [j7]Kai Brünnler:
Deep sequent systems for modal logic. Arch. Math. Log. 48(6): 551-577 (2009) - [j6]Kai Brünnler, Thomas Studer:
Syntactic cut-elimination for common knowledge. Ann. Pure Appl. Log. 160(1): 82-95 (2009) - [c7]Kai Brünnler, Lutz Straßburger:
Modular Sequent Systems for Modal Logic. TABLEAUX 2009: 152-166 - 2008
- [j5]Kai Brünnler, Martin Lange:
Cut-free sequent systems for temporal logic. J. Log. Algebraic Methods Program. 76(2): 216-225 (2008) - [j4]Kai Brünnler, Dieter Probst, Thomas Studer:
On contraction and the modal fragment. Math. Log. Q. 54(4): 345-349 (2008) - [c6]Kai Brünnler, Richard McKinley:
An Algorithmic Interpretation of a Deep Inference System. LPAR 2008: 482-496 - 2007
- [c5]Kai Brünnler, Thomas Studer:
Syntactic Cut-elimination for Common Knowledge. M4M 2007: 227-240 - 2006
- [j3]Kai Brünnler:
Locality for Classical Logic. Notre Dame J. Formal Log. 47(4): 557-580 (2006) - [j2]Kai Brünnler:
Cut Elimination inside a Deep Inference System for Classical Predicate Logic. Stud Logica 82(1): 51-71 (2006) - [c4]Kai Brünnler:
Deep Sequent Systems for Modal Logic. Advances in Modal Logic 2006: 107- - [c3]Kai Brünnler:
Deep Inference and Its Normal Form of Derivations. CiE 2006: 65-74 - 2003
- [b1]Kai Brünnler:
Deep inference and symmetry in classical proofs. Dresden University of Technology, Germany, Logos-Verlag 2003, ISBN 3-8325-0448-6, pp. 1-93 - [j1]Kai Brünnler:
Two Restrictions on Contraction. Log. J. IGPL 11(5): 525-529 (2003) - [c2]Kai Brünnler:
Atomic Cut Elimination for classical Logic. CSL 2003: 86-97 - 2001
- [c1]Kai Brünnler, Alwen Fernanto Tiu:
A Local System for Classical Logic. LPAR 2001: 347-361
Coauthor Index
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-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
