Results 41 to 50 of about 131,879,682 (302)

A Proof of Kamp's theorem [PDF]

Logical Methods in Computer Science, 2014
We provide a simple proof of Kamp's theorem.
Alexander Rabinovich
doaj   +1 more source

Products of effective topological spaces and a uniformly computable Tychonoff Theorem [PDF]

Logical Methods in Computer Science, 2013
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces.
Robert Rettinger, Klaus Weihrauch
doaj   +1 more source

The Pebble-Relation Comonad in Finite Model Theory [PDF]

Logical Methods in Computer Science
The pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory.
Yoàv Montacute, Nihil Shah
doaj   +1 more source

On the logical complexity of cyclic arithmetic [PDF]

Logical Methods in Computer Science, 2020
We study the logical complexity of proofs in cyclic arithmetic ($\mathsf{CA}$), as introduced in Simpson '17, in terms of quantifier alternations of formulae occurring. Writing $C\Sigma_n$ for (the logical consequences of) cyclic proofs containing only $\
Anupam Das
doaj   +1 more source

Completions of Kleene's second model [PDF]

Logical Methods in Computer Science
We investigate completions of partial combinatory algebras (pcas), in particular of Kleene's second model $\mathcal{K}_2$ and generalizations thereof. We consider weak and strong notions of embeddability and completion that have been studied before in ...
Sebastiaan A. Terwijn
doaj   +1 more source

On the system CL12 of computability logic [PDF]

Logical Methods in Computer Science, 2015
Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as abstract models of interactive computational problems.
Giorgi Japaridze
doaj   +1 more source

Clause Set Cycles and Induction [PDF]

Logical Methods in Computer Science, 2020
In this article we relate a family of methods for automated inductive theorem proving based on cycle detection in saturation-based provers to well-known theories of induction.
Stefan Hetzl, Jannik Vierling
doaj   +1 more source

Artificial molecular machines and motors—Design and control of nanoscale motion

FEBS Letters, EarlyView.
Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley   +1 more source

An Analysis of Tennenbaum's Theorem in Constructive Type Theory [PDF]

Logical Methods in Computer Science
Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers.
Marc Hermes, Dominik Kirst
doaj   +1 more source

Ordered Models of the Lambda Calculus [PDF]

Logical Methods in Computer Science, 2013
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model with bottom ...
Antonino Salibra, Alberto Carraro
doaj   +1 more source