Results 21 to 30 of about 699,995 (283)
Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type Theory [PDF]
Logic in Computer Science 2020 (LICS'20), 2020 Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent of induction for cycles for the case that the graph is given as the symmetric closure of a locally confluent and ...
arxiv +1 more source
Expressiveness of Metric modalities for continuous time [PDF]
Logical Methods in Computer Science, 2007 We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals.
Yoram Hirshfeld, Alexander Rabinovich
doaj +1 more source
A Rewriting Coherence Theorem with Applications in Homotopy Type Theory [PDF]
Mathematical Structures in Computer Science, 1-33, 2023, 2021 Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by finding a homotopy basis for the rewriting system.
arxiv +1 more source
Non-Deterministic Kleene Coalgebras [PDF]
Logical Methods in Computer Science, 2010 In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems.
Alexandra Silva +2 more
doaj +1 more source
A rich hierarchy of functionals of finite types [PDF]
Logical Methods in Computer Science, 2009 We are considering typed hierarchies of total, continuous functionals using complete, separable metric spaces at the base types. We pay special attention to the so called Urysohn space constructed by P. Urysohn. One of the properties of the Urysohn space
Dag Normann
doaj +1 more source
The Wadge Hierarchy of Deterministic Tree Languages [PDF]
Logical Methods in Computer Science, 2008 We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to another.
Filip Murlak
doaj +1 more source
Proof-irrelevant model of CC with predicative induction and judgmental equality [PDF]
Logical Methods in Computer Science, 2011 We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's trace encoding
Gyesik Lee, Benjamin Werner
doaj +1 more source
Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator [PDF]
Logical Methods in Computer Science, 2012 For an NP intersect coNP function g of the Nisan-Wigderson type and a string b outside its range we consider a two player game on a common input a to the function.
Jan Krajíček
doaj +1 more source
On Berry's conjectures about the stable order in PCF [PDF]
Logical Methods in Computer Science, 2012 PCF is a sequential simply typed lambda calculus language. There is a unique order-extensional fully abstract cpo model of PCF, built up from equivalence classes of terms. In 1979, G\'erard Berry defined the stable order in this model and proved that the
Fritz Müller
doaj +1 more source
Development of the Magnetic Excitations of Charge-Stripe Ordered La(2-x)Sr(x)NiO(4) on Doping Towards Checkerboard Charge Order [PDF]
, 2013 The magnetic excitation spectrums of charge stripe ordered La(2-x)Sr(x)NiO(4) x = 0.45 and x = 0.4 were studied by inelastic neutron scattering. We found the magnetic excitation spectrum of x = 0.45 from the ordered Ni^2+ S = 1 spins to match that of ...
Freeman, P. G. +4 more
core +4 more sources