Results 21 to 30 of about 2,593,900 (78)
On-line Adaptive Chain Covering of Upgrowing Posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain.
Bartłomiej Bosek, Piotr Micek
doaj +1 more source
Random Boolean expressions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We examine how we can define several probability distributions on the set of Boolean functions on a fixed number of variables, starting from a representation of Boolean expressions by trees.
Danièle Gardy
doaj +1 more source
An independent axiomatisation for free short-circuit logic [PDF]
, 2017 Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression.
Ponse, Alban, Staudt, Daan J. C.
core +3 more sources
Division by zero in common meadows [PDF]
, 2021 Common meadows are fields expanded with a total inverse function. Division by zero produces an additional value denoted with "a" that propagates through all operations of the meadow signature (this additional value can be interpreted as an error element).
Bergstra, Jan A., Ponse, Alban
core +2 more sources
arXiv, 2023 Logic really is just algebra, given one uses the right kind of algebra, and the right kind of logic. The right kind of algebra is abstraction algebra, and the right kind of logic is abstraction logic.
arxiv
STV+Reductions: Towards Practical Verification of Strategic Ability Using Model Reductions
, 2023 We present a substantially expanded version of our tool STV for strategy synthesis and verification of strategic abilities. The new version adds user-definable models and support for model reduction through partial order reduction and checking for ...
Jamroga, Wojciech +3 more
core +1 more source
Poly-infix operators and operator families [PDF]
, 2015 Poly-infix operators and operator families are introduced as an alternative for working modulo associativity and the corresponding bracket deletion convention.
Bergstra, Jan A., Ponse, Alban
core +3 more sources
Computer theorem proving in math [PDF]
, 2004 We give an overview of issues surrounding computer-verified theorem proving in the standard pure-mathematical context. This is based on my talk at the PQR conference (Brussels, June 2003)
Carlos Simpson +1 more
core +4 more sources
Logical foundations: Personal perspective [PDF]
arXiv, 2021 This is an attempt to illustrate the glorious history of logical foundations and to discuss the uncertain future.
arxiv
Normalisation Control in Deep Inference via Atomic Flows [PDF]
, 2008 We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations. This allows us to
Alessio Guglielmi +2 more
core +7 more sources