![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Asta Halkjær From
Person information
- affiliation: Technical University of Denmark, DTU Compute, Copenhagen, Denmark
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Asta Halkjær From
, Frederik Krogsdal Jacobsen
:
Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL. J. Autom. Reason. 68(3): 15 (2024) - 2023
- [j11]Asta Halkjær From:
Synthetic Completeness. Arch. Formal Proofs 2023 (2023) - [j10]Asta Halkjær From
, Anders Schlichtkrull
, Jørgen Villadsen
:
A sequent calculus for first-order logic formalized in Isabelle/HOL. J. Log. Comput. 33(4): 818-836 (2023) - [c19]Jannis Limperg
, Asta Halkjær From
:
Aesop: White-Box Best-First Proof Search for Lean. CPP 2023: 253-266 - [c18]Asta Halkjær From
, Jørgen Villadsen
:
A Naive Prover for First-Order Logic: A Minimal Example of Analytic Completeness. TABLEAUX 2023: 468-480 - 2022
- [j9]Asta Halkjær From:
A Naive Prover for First-Order Logic. Arch. Formal Proofs 2022 (2022) - [j8]Asta Halkjær From, Frederik Krogsdal Jacobsen:
A Sequent Calculus Prover for First-Order Logic with Functions. Arch. Formal Proofs 2022 (2022) - [j7]Asta Halkjær From, Jørgen Villadsen:
Soundness and Completeness of Implicational Logic. Arch. Formal Proofs 2022 (2022) - [c17]Asta Halkjær From
, Frederik Krogsdal Jacobsen
:
Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL. ITP 2022: 13:1-13:22 - 2021
- [j6]Asta Halkjær From:
Public Announcement Logic. Arch. Formal Proofs 2021 (2021) - [j5]Asta Halkjær From:
Soundness and Completeness of an Axiomatic System for First-Order Logic. Arch. Formal Proofs 2021 (2021) - [c16]Asta Halkjær From, Anders Schlichtkrull, Jørgen Villadsen:
A Sequent Calculus for First-Order Logic Formalized in Isabelle/HOL. CILC 2021: 107-121 - [c15]Asta Halkjær From
, Simon Tobias Lund
, Jørgen Villadsen
:
A Case Study in Computer-Assisted Meta-reasoning. DCAI (2) 2021: 53-63 - [c14]Asta Halkjær From
:
Formalizing Henkin-Style Completeness of an Axiomatic System for Propositional Logic. ESSLLI Student Sessions 2021: 80-92 - [c13]Asta Halkjær From
, Agnes Moesgård Eschen, Jørgen Villadsen
:
Formalizing Axiomatic Systems for Propositional Logic in Isabelle/HOL. CICM 2021: 32-46 - [c12]Asta Halkjær From
:
A Succinct Formalization of the Completeness of First-Order Logic. TYPES 2021: 8:1-8:24 - [c11]Asta Halkjær From
:
Formalized Soundness and Completeness of Epistemic Logic. WoLLIC 2021: 1-15 - [c10]Asta Halkjær From
, Frederik Krogsdal Jacobsen
, Jørgen Villadsen
:
SeCaV: A Sequent Calculus Verifier in Isabelle/HOL. LSFA 2021: 38-55 - [c9]Jørgen Villadsen
, Asta Halkjær From
, Patrick Blackburn
:
Teaching Intuitionistic and Classical Propositional Logic Using Isabelle. ThEdu@CADE 2021: 71-85 - 2020
- [c8]Asta Halkjær From
, Patrick Blackburn
, Jørgen Villadsen
:
Formalizing a Seligman-Style Tableau System for Hybrid Logic - (Short Paper). IJCAR (1) 2020: 474-481 - [c7]Asta Halkjær From
:
Synthetic Completeness for a Terminating Seligman-Style Tableau System. TYPES 2020: 5:1-5:17 - [c6]Asta Halkjær From
, Jørgen Villadsen
, Patrick Blackburn
:
Isabelle/HOL as a Meta-Language for Teaching Logic. ThEdu@IJCAR 2020: 18-34
2010 – 2019
- 2019
- [j4]Asta Halkjær From:
A Sequent Calculus for First-Order Logic. Arch. Formal Proofs 2019 (2019) - [j3]Asta Halkjær From:
Formalizing a Seligman-Style Tableau System for Hybrid Logic. Arch. Formal Proofs 2019 (2019) - [c5]Asta Halkjær From
, Alexander Birch Jensen
, Anders Schlichtkrull, Jørgen Villadsen
:
Teaching a Formalized Logical Calculus. ThEdu@CADE 2019: 73-92 - 2018
- [j2]Asta Halkjær From:
Epistemic Logic. Arch. Formal Proofs 2018 (2018) - [j1]Jørgen Villadsen
, Asta Halkjær From
, Salvador Jacobi, Nikolaj Nøkkentved Larsen:
Multi-agent programming contest 2016 - the Python-DTU team. Int. J. Agent Oriented Softw. Eng. 6(1): 86-100 (2018) - [c4]Jørgen Villadsen, Anders Schlichtkrull, Asta Halkjær From:
A Verified Simple Prover for First-Order Logic. PAAR@FLoC 2018: 88-104 - [c3]Anders Schlichtkrull, Jørgen Villadsen
, Asta Halkjær From
:
Students' Proof Assistant (SPA). ThEdu@FLoC 2018: 1-13 - [c2]Jørgen Villadsen
, Asta Halkjær From
, Anders Schlichtkrull:
Natural Deduction Assistant (NaDeA). ThEdu@FLoC 2018: 14-29 - [p1]Jørgen Villadsen
, Mads Okholm Bjørn, Asta Halkjær From
, Thomas Søren Henney, John Bruntse Larsen:
Multi-Agent Programming Contest 2018 - The Jason-DTU Team. The Multi-Agent Programming Contest 2018: 41-71 - 2017
- [c1]Jørgen Villadsen
, Asta Halkjær From
, Anders Schlichtkrull:
Natural Deduction and the Isabelle Proof Assistant. ThEdu@CADE 2017: 140-155
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-07-20 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint