Results 31 to 40 of about 49,025 (266)
Effective zero-dimensionality for computable metric spaces [PDF]
Logical Methods in Computer Science, 2015 We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent.
Robert Kenny
doaj +1 more source
A duality theoretic view on limits of finite structures: Extended version [PDF]
Logical Methods in Computer Science, 2022 A systematic theory of structural limits for finite models has been developed by Nesetril and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a space of ...
Mai Gehrke, Tomáš Jakl, Luca Reggio
doaj +1 more source
Logicism and the Development of Computer Science [PDF]
, 2002 This paper argues for the thesis that ideas originating in the philosophy of mathematics have proved very helpful for the development of computer science. In particular, logicism, the view that mathematics can be reduced to logic, was developed by Frege and Russell, long before computers were invented, and yet many of the ideas of logicism have been ...
openaire +2 more sources
On noncommutative extensions of linear logic [PDF]
Logical Methods in Computer Science, 2019 Pomset logic introduced by Retor\'e is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus.
Sergey Slavnov
doaj +1 more source
Tree-Automatic Well-Founded Trees [PDF]
Logical Methods in Computer Science, 2013 We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega.
Martin Huschenbett +3 more
doaj +1 more source
Geometric Logic in Computer Science [PDF]
, 1993 We present an introduction to geometric logic and the mathematical structures associated with it, such as categorical logic and toposes. We also describe some of its applications in computer science including its potential as a logic for specification languages.
openaire +1 more source
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 ScienceThe 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