Results 21 to 30 of about 887,077 (234)
Unification and Logarithmic Space [PDF]
Logical Methods in Computer Science, 2018 We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification.
Clément Aubert, Marc Bagnol
doaj +1 more source
Build your own clarithmetic I: Setup and completeness [PDF]
Logical Methods in Computer Science, 2017 Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic ...
Giorgi Japaridze
doaj +1 more source
Bounded degree and planar spectra [PDF]
Logical Methods in Computer Science, 2017 The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE.
Anuj Dawar, Eryk Kopczyński
doaj +1 more source
Adventures in time and space [PDF]
Logical Methods in Computer Science, 2007 This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomial-time computable functions, and its
Norman Danner, James S. Royer
doaj +1 more source
On tractability and congruence distributivity [PDF]
Logical Methods in Computer Science, 2007 Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi.
Emil Kiss, Matthew Valeriote
doaj +1 more source
The Complexity of Infinite Computations In Models of Set Theory [PDF]
Logical Methods in Computer Science, 2009 We prove the following surprising result: there exist a 1-counter B\"uchi automaton and a 2-tape B\"uchi automaton such that the \omega-language of the first and the infinitary rational relation of the second in one model of ZFC are \pi_2^0-sets, while ...
Olivier Finkel
doaj +1 more source
Coinductive Proof Principles for Stochastic Processes [PDF]
Logical Methods in Computer Science, 2007 We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when solutions are not unique.
Dexter Kozen
doaj +1 more source
Applications of Metric Coinduction [PDF]
Logical Methods in Computer Science, 2009 Metric coinduction is a form of coinduction that can be used to establish properties of objects constructed as a limit of finite approximations. One can prove a coinduction step showing that some property is preserved by one step of the approximation ...
Dexter Kozen, Nicholas Ruozzi
doaj +1 more source
Noncomputable functions in the Blum-Shub-Smale model [PDF]
Logical Methods in Computer Science, 2011 Working in the Blum-Shub-Smale model of computation on the real numbers, we answer several questions of Meer and Ziegler. First, we show that, for each natural number d, an oracle for the set of algebraic real numbers of degree at most d is insufficient ...
Wesley Calvert +2 more
doaj +1 more source
Barriers in Concurrent Separation Logic: Now With Tool Support! [PDF]
Logical Methods in Computer Science, 2012 We develop and prove sound a concurrent separation logic for Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is widely used for verification, there has not been any effort to combine the two.
Aquinas Hobor, Cristian Gherghina
doaj +1 more source