Zobrazeno 1 - 10
of 200
pro vyhledávání: '"Haeusler, Edward"'
This paper describes a quantum algorithm for proof search in sequent calculus of a subset of Linear Logic using the Grover Search Algorithm. We briefly overview the Grover Search Algorithm and Linear Logic, show the detailed steps of the algorithm an
Externí odkaz:
http://arxiv.org/abs/2302.09169
Publikováno v:
Part of a previous version of this compression algorithm was published in Studia Logica 107(1), pp.55-83, 2019. Part of the paper was published in pre-proceedings of LSFA2022
This report defines (plain) Dag-like derivations in the purely implicational fragment of minimal logic $M_{\imply}$. Introduce the horizontal collapsing set of rules and the algorithm {\bf HC}. Explain why {\bf HC} can transform any polynomial height
Externí odkaz:
http://arxiv.org/abs/2206.02300
We conjecture that the relative unpopularity of logical frameworks among practitioners is partly due to their complex meta-languages, which often demand both programming skills and theoretical knowledge of the meta-language in question for them to be
Externí odkaz:
http://arxiv.org/abs/2106.13843
Autor:
Haeusler, Edward Hermann
This article shows yet another proof of NP=CoNP$. In a previous article, we proved that NP=PSPACE and from it we can conclude that NP=CoNP immediately. The former proof shows how to obtain polynomial and, polynomial in time checkable Dag-like proofs
Externí odkaz:
http://arxiv.org/abs/2101.00003
Autor:
Haeusler, Edward Hermann
A previous article shows that any linear height bounded normal proof of a tautology in the Natural Deduction for Minimal implicational logic $M_{\supset}$ is as huge as it is redundant. More precisely, any proof in a family of super-polynomially size
Externí odkaz:
http://arxiv.org/abs/2012.07833
Autor:
Haeusler, Edward Hermann
This article precisely defines huge proofs within the system of Natural Deduction for the Minimal implicational propositional logic \mil. This is what we call an unlimited family of super-polynomial proofs. We consider huge families of expanded norma
Externí odkaz:
http://arxiv.org/abs/2009.09802
Autor:
Haeusler, Edward Hermann
We estimate the size of a labelled tree by comparing the amount of (labelled) nodes with the size of the set of labels. Roughly speaking, a exponentially big labelled tree, is any labelled tree that has an exponential gap between its size, number of
Externí odkaz:
http://arxiv.org/abs/2004.10659
In a previously published ENTCS paper (Santos et al. (2016)), we introduced a sequent calculus called $\mathbf{LMT^{\rightarrow}}$ for Minimal Implicational Propositional Logic ($\mathbf{LMT^{\rightarrow}}$). This calculus provides a proof search pro
Externí odkaz:
http://arxiv.org/abs/1905.02059
In this article we show how Hans Kelsen jurisprudence and Intuitionistic logic are used to avoid the well-known contrary-to-duty (CTD) paradoxes, such as Chisholm paradoxes and its variants. This article uses an intuitionistic version of the ALC desc
Externí odkaz:
http://arxiv.org/abs/1803.07543
Publikováno v:
Legal Knowledge and Information Systems 302 (2017) 89-94
In Brazil, all legal professionals must demonstrate their knowledge of the law and its application by passing the OAB exams, the national bar exams. The OAB exams therefore provide an excellent benchmark for the performance of legal information syste
Externí odkaz:
http://arxiv.org/abs/1712.05128