Results 21 to 30 of about 43,286 (100)
Internal Pattern Matching Queries in a Text and Applications
, 2014 We consider several types of internal queries: questions about subwords of a text. As the main tool we develop an optimal data structure for the problem called here internal pattern matching.
Kociumaka, Tomasz +3 more
core +1 more source
How unprovable is Rabin's decidability theorem?
, 2015 We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical core of typical ...
Beckmann A. +6 more
core +1 more source
A formally verified proof of the prime number theorem
, 2005 The prime number theorem, established by Hadamard and de la Vall'ee Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1 / ln x.
Avigad, Jeremy +3 more
core +7 more sources
Non-principal ultrafilters, program extraction and higher order reverse mathematics
, 2011 We investigate the strength of the existence of a non-principal ultrafilter over fragments of higher order arithmetic. Let U be the statement that a non-principal ultrafilter exists and let ACA_0^{\omega} be the higher order extension of ACA_0. We show
ALEXANDER P. KREUZER +2 more
core +1 more source
Scalable Interactive Volume Rendering Using Off-the-shelf Components [PDF]
, 2001 This paper describes an application of a second generation implementation of the Sepia architecture (Sepia-2) to interactive volu-metric visualization of large rectilinear scalar fields. By employingpipelined associative blending operators in a sort-last
Breen, David +4 more
core +2 more sources
Computational reverse mathematics and foundational analysis [PDF]
, 2018 Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which
Eastaugh, Benedict
core +1 more source
Lewis meets Brouwer: constructive strict implication
, 2017 C. I. Lewis invented modern modal logic as a theory of "strict implication". Over the classical propositional calculus one can as well work with the unary box connective.
Litak, Tadeusz, Visser, Albert
core +1 more source
The modal logic of arithmetic potentialism and the universal algorithm
, 2018 I investigate the modal commitments of various conceptions of the philosophy of arithmetic potentialism. Specifically, I consider the natural potentialist systems arising from the models of arithmetic under their natural extension concepts, such as end ...
Hamkins, Joel David
core
Some applications of logic to feasibility in higher types
, 2002 In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions.
Ignjatovic, Aleksandar, Sharma, Arun
core +1 more source
PHScaffolding: a hypergraph clustering and dual-weight integration strategy for scaffolding with Pore-C reads. [PDF]
Brief BioinformSu Q, Luo J, Guo F.
europepmc +1 more source