Zobrazeno 1 - 10
of 197
pro vyhledávání: '"Beckmann, Arnold"'
Autor:
Beckmann, Arnold, Yamagata, Yoriyuki
We consider pure equational theories that allow substitution but disallow induction, which we denote as PETS, based on recursive definition of their function symbols. We show that the Bounded Arithmetic theory $S^1_2$ proves the consistency of PETS.
Externí odkaz:
http://arxiv.org/abs/2203.04832
This paper contributes to the verification of programs written in Bitcoin's smart contract language SCRIPT in the interactive theorem prover Agda. It focuses on the security property of access control for SCRIPT programs that govern the distribution
Externí odkaz:
http://arxiv.org/abs/2203.03054
Publikováno v:
In Computers in Industry February 2022 135
Autor:
Lakshmanan, Kayal, Borghini, Eugenio, Beckmann, Arnold, Pleydell-Pearce, Cameron, Giannetti, Cinzia
Publikováno v:
In Procedia Computer Science 2022 207:1057-1066
Autor:
Beckmann, Arnold, Buss, Sam
Publikováno v:
In Annals of Pure and Applied Logic October 2019 170(10):1176-1187
Autor:
Vessio, Monica L., Beckmann, Arnold, Roach, Matt, Saintier, Séverine, Clements, Rhys, Setzer, Anton
Publikováno v:
European Journal of Law & Technology; 2024, Vol. 15 Issue 2, p77-111, 35p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Aehlig, Klaus, Beckmann, Arnold
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all the known r
Externí odkaz:
http://arxiv.org/abs/0712.1499
We investigate the relation of countable closed subsets of the reals with respect to continuous monotone embeddability; we show that there are exactly aleph_1 many equivalence classes with respect to this embeddability relation. This is an extension
Externí odkaz:
http://arxiv.org/abs/math/0411117