Results 31 to 40 of about 131,879,682 (302)
Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees [PDF]
Logical Methods in Computer Science, 2015 We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly closed ...
Eike Neumann
doaj +1 more source
Encoding of Planning Problems and Their Optimizations in Linear Logic [PDF]
, 2009 Girard’s Linear Logic is a formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for an easily understandable encoding of many problems.
Chrpa, Lukáš +5 more
core +1 more source
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
Logics in Computer Science [PDF]
, 2010 In this thesis, we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts.
openaire +2 more sources
Interfacing Coq + SSReflect with GAP [PDF]
, 2012 Presentation slides and preprint both provided by author. Preprint published in Electronic Notes in Theoretical Computer Science: Proceedings of the 9th International Workshop On User Interfaces for Theorem Provers (UITP10).We report on an extendable ...
Komendantsky, Vladimir +3 more
core +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 +3 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 +2 more sources