default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominik Kirst
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Marc Hermes
, Dominik Kirst:
An Analysis of Tennenbaum's Theorem in Constructive Type Theory. Log. Methods Comput. Sci. 20(1) (2024)- [c19]Ian Shillito, Dominik Kirst:
A Mechanised and Constructive Reverse Analysis of Soundness and Completeness of Bi-intuitionistic Logic. CPP 2024: 218-229 - [c18]Yannick Forster, Dominik Kirst, Niklas Mück:
The Kleene-Post and Post's Theorem in the Calculus of Inductive Constructions. CSL 2024: 29:1-29:20 - [c17]Liron Cohen, Yannick Forster, Dominik Kirst, Bruno da Rocha Paiva, Vincent Rahli:
Separating Markov's Principles. LICS 2024: 28:1-28:14 - 2023
- [j5]Dominik Kirst, Marc Hermes:
Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq. J. Autom. Reason. 67(1): 13 (2023) - [c16]Yannick Forster, Dominik Kirst, Niklas Mück:
Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions. APLAS 2023: 155-181 - [c15]Dominik Kirst, Benjamin Peters:
Gödel's Theorem Without Tears - Essential Incompleteness in Synthetic Computability. CSL 2023: 30:1-30:18 - [i5]Marc Hermes, Dominik Kirst:
An Analysis of Tennenbaum's Theorem in Constructive Type Theory. CoRR abs/2302.14699 (2023) - [i4]Yannick Forster, Dominik Kirst, Niklas Mück:
Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions. CoRR abs/2307.15543 (2023) - 2022
- [j4]Dominik Kirst, Dominique Larchey-Wendling:
Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens. Log. Methods Comput. Sci. 18(2) (2022) - [j3]Christian Hagemeier, Dominik Kirst:
Constructive and mechanised meta-theory of IEL and similar modal logics. J. Log. Comput. 32(8): 1585-1610 (2022) - [c14]Mark Koch, Dominik Kirst:
Undecidability, incompleteness, and completeness of second-order logic in Coq. CPP 2022: 274-290 - [c13]Marc Hermes, Dominik Kirst:
An Analysis of Tennenbaum's Theorem in Constructive Type Theory. FSCD 2022: 9:1-9:19 - [c12]Johannes Hostert, Andrej Dudenhefner, Dominik Kirst:
Undecidability of Dyadic First-Order Logic in Coq. ITP 2022: 19:1-19:19 - [c11]Dominik Kirst:
Computational Back-And-Forth Arguments in Constructive Type Theory. ITP 2022: 22:1-22:12 - [c10]Christian Hagemeier, Dominik Kirst:
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic. LFCS 2022: 90-111 - [c9]Dominik Wehr, Dominik Kirst:
Material Dialogues for First-Order Logic in Constructive Type Theory. WoLLIC 2022: 344-361 - 2021
- [j2]Yannick Forster, Dominik Kirst, Dominik Wehr:
Completeness theorems for first-order logic analysed in constructive type theory. J. Log. Comput. 31(1): 112-151 (2021) - [c8]Dominik Kirst, Felix Rech:
The generalised continuum hypothesis implies the axiom of choice in Coq. CPP 2021: 313-326 - [c7]Dominik Kirst, Marc Hermes:
Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq. ITP 2021: 23:1-23:20 - [i3]Dominik Kirst, Dominique Larchey-Wendling:
Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens. CoRR abs/2104.14445 (2021) - 2020
- [c6]Dominik Kirst, Dominique Larchey-Wendling:
Trakhtenbrot's Theorem in Coq - A Constructive Approach to Finite Model Theory. IJCAR (2) 2020: 79-96 - [c5]Yannick Forster, Dominik Kirst, Dominik Wehr:
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory. LFCS 2020: 47-74 - [i2]Dominik Kirst, Dominique Larchey-Wendling:
Trakhtenbrot's Theorem in Coq, A Constructive Approach to Finite Model Theory. CoRR abs/2004.07390 (2020) - [i1]Yannick Forster, Dominik Kirst, Dominik Wehr:
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory (Extended Version). CoRR abs/2006.04399 (2020)
2010 – 2019
- 2019
- [j1]Dominik Kirst, Gert Smolka:
Categoricity Results and Large Model Constructions for Second-Order ZF in Dependent Type Theory. J. Autom. Reason. 63(2): 415-438 (2019) - [c4]Yannick Forster, Dominik Kirst, Gert Smolka:
On synthetic undecidability in coq, with an application to the entscheidungsproblem. CPP 2019: 38-51 - 2018
- [c3]Dominik Kirst, Gert Smolka:
Large model constructions for second-order ZF in dependent type theory. CPP 2018: 228-239 - 2017
- [c2]Dominik Kirst, Gert Smolka:
Categoricity Results for Second-Order ZF in Dependent Type Theory. ITP 2017: 304-318 - 2016
- [c1]Dominik Kirst, Andreas Bulling:
On the Verge: Voluntary Convergences for Accurate and Precise Timing of Gaze Input. CHI Extended Abstracts 2016: 1519-1525
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-10-07 21:20 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:
