Results 1 to 10 of about 759,615 (239)
Modalities in homotopy type theory [PDF]
Logical Methods in Computer Science, 2020 Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes.
Egbert Rijke +2 more
doaj +1 more source
Perfect Matching in Random Graphs is as Hard as Tseitin [PDF]
TheoretiCS, 2022 We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times.
Per Austrin, Kilian Risse
doaj +1 more source
Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative [PDF]
Logical Methods in Computer Science, 2006 We answer Klop and de Vrijer's question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a "syntactic" proof that the extensional lambda calculus
Kristian Stoevring
doaj +1 more source
Banach Spaces as Data Types [PDF]
Logical Methods in Computer Science, 2011 We introduce the operators "modified limit" and "accumulation" on a Banach space, and we use this to define what we mean by being internally computable over the space.
Dag Normann
doaj +1 more source
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps [PDF]
Logic in Computer Science, 2016 We prove near-optimal trade-offs for quantifier depth versus number of variables in first-order logic by exhibiting pairs of n-element structures that can be distinguished by a k-variable first-order sentence but where every such sentence requires ...
Christoph Berkholz, Jakob Nordström
semanticscholar +1 more source
A Proof of Kamp's theorem [PDF]
Log. Methods Comput. Sci., 2014 We provide a simple proof of Kamp’s theorem.
A. Rabinovich
semanticscholar +1 more source
On Constructor Rewrite Systems and the Lambda Calculus [PDF]
Logical Methods in Computer Science, 2012 We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead.
Ugo Dal Lago, Simone Martini
doaj +1 more source
Existence of strongly proper dyadic subbases [PDF]
Logical Methods in Computer Science, 2017 We consider a topological space with its subbase which induces a coding for each point. Every second-countable Hausdorff space has a subbase that is the union of countably many pairs of disjoint open subsets.
Yasuyuki Tsukamoto
doaj +1 more source
On the Monadic Second-Order Transduction Hierarchy [PDF]
Logical Methods in Computer Science, 2010 We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K).
Achim Blumensath, Bruno Courcelle
doaj +1 more source