Daniel Misselbeck-Wessel

Orcid: 0000-0002-6768-4457

According to our database1, Daniel Misselbeck-Wessel authored at least 15 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Complemented subsets and Boolean-valued, partial functions.
Comput., 2024

2023
Maximal elements with minimal logic.
Inf. Process. Lett., August, 2023

Radical theory of Scott-open filters.
Theor. Comput. Sci., February, 2023

2022
A formal approach to Menger's theorem.
Reports Math. Log., November, 2022

The Jacobson radical for an inconsistency predicate.
Comput., 2022

The Jacobson radical of a Propositional Theory.
Bull. Symb. Log., 2022

Algebras of Complemented Subsets.
Proceedings of the Revolutions and Revelations in Computability, 2022

2020
Resolving finite indeterminacy: A definitive constructive universal prime ideal theorem.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

The Computational Significance of Hausdorff's Maximal Chain Principle.
Proceedings of the Beyond the Horizon of Computability, 2020

2019
Some forms of excluded middle for linear orders.
Math. Log. Q., 2019

Cut elimination for entailment relations.
Arch. Math. Log., 2019

2018
A General Extension Theorem for Directed-Complete Partial Orders.
Reports Math. Log., 2018

Extension by Conservation. Sikorski's Theorem.
Log. Methods Comput. Sci., 2018

Suzumura Consistency, an Alternative Approach.
FLAP, 2018

2017
Eliminating Disjunctions by Disjunction Elimination.
Bull. Symb. Log., 2017


  Loading...