Zobrazeno 1 - 10
of 218
pro vyhledávání: '"Kristiansen, Lars"'
We introduce a first-order theory $\mathsf{Seq}$ which is mutually interpretable with Robinson's $\mathsf{Q}$. The universe of a standard model for $\mathsf{Seq}$ consists of sequences. We prove that $\mathsf{Seq}$ directly interprets the adjuctive s
Externí odkaz:
http://arxiv.org/abs/2402.14286
We study the computational complexity of converting one representation of real numbers into another representation. Typical examples of representations are Cauchy sequences, base-10 expansions, Dedekind cuts and continued fractions.
Externí odkaz:
http://arxiv.org/abs/2304.07227
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
Comment: arXiv
Comment: arXiv
Externí odkaz:
http://arxiv.org/abs/2003.04964
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
Externí odkaz:
http://arxiv.org/abs/1804.06367
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these representati
Externí odkaz:
http://arxiv.org/abs/1804.05330
Publikováno v:
Phys. Rev. B 97, 020402(R) (2018)
In antiferromagnets, the Dzyaloshinskii-Moriya interaction lifts the degeneracy of left- and right-circularly polarized spin waves. This relativistic coupling increases the efficiency of spin-wave-induced domain wall motion and leads to higher drift
Externí odkaz:
http://arxiv.org/abs/1705.01572
Publikováno v:
In Annals of Pure and Applied Logic February 2021 172(2)
This paper is a preliminary report on our search for new good examples of Hall's Conjecture. We present a new algorithm that will detect all good examples within a given search space. We have implemented the algorithm, and our executions have so far
Externí odkaz:
http://arxiv.org/abs/1401.4345