Results 21 to 30 of about 268 (109)

The Communication Complexity of Enumeration, Elimination, and Selection [PDF]

, 2000
Let k, n∈N and f:{0, 1}n×{0, 1}n→{0, 1}. Assume Alice has x1, …, xk∈ {0, 1}n, Bob has y1, …, yk∈{0, 1}n, and they want to compute fk(x1x2···xk, y1y2···yk)=(f(x1, y1), …, f(xk, yk)) (henceforth f(x1, y1)···f(xk, yk)) communicating as few bits as possible.
Kalayanasundaram, B., Andris Ambainis, Buhrman, H.M. (Harry), Leen Torenvliet, Buhrman, H.M., Andris Ambainis, Gasarch, W., Torenvliet, L. (Leen), Ambainis, A. (Andris), Gasarch, W.I., Kalyanasundaram, B., Ambainis, Andris, Buhrman, Harry, Gasarch, William, Harry Buhrman, Torenvliet, L., William Gasarch, Ambainis, A., Bala Kalyanasundaram, Kalyanasundaram, Bala, Torenvliet, Leen   +20 more
core   +1 more source

Realization Theorems for Justification Logics: Full Modularity

, 2015
Justification logics were introduced by Artemov in 1995 to provide intuitionistic logic with a classical provability semantics, a problem originally posed by Gödel. Justification logics are refinements of modal logics and formally connected to them by so-
Borg, Annemarie, Kuznets, Roman, Roman Kuznets, Annemarie Borg   +3 more
core   +1 more source

Algebraic proofs of cut elimination

, 2008
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive.
Jeremy Avigad
core  

Type-Inference Based Deforestation of Functional Programs [PDF]

, 2000
In lazy functional programming modularity is often achieved by using intermediate data structures to combine separate parts of a program. Each intermediate data structure is produced by one part and consumed by another one.
Olaf Chitil, Chitil, Olaf
core  

Stringent constraints on the scalar K$ \pi$ form factor from analyticity, unitarity and low-energy theorems [PDF]

, 2010
We investigate the scalar K pi form factor at low energies by the method of unitarity bounds adapted so as to include information on the phase and modulus along the elastic region of the unitarity cut.
I. Caprini, Imsong, IS, Abbas, G, S. Ramanan, I. Sentitemsu Imsong, Ramanan, S, B. Ananthanarayan, Caprini, I, Gauhar Abbas, Ananthanarayan, B   +9 more
core   +1 more source

On the relationship between hypersequent calculi and labelled sequent calculi for intermediate logics with geometric Kripke semantics

, 2010
In this thesis we examine the relationship between hypersequent and some types of labelled sequent calculi for a subset of intermediate logics—logics between intuitionistic (Int), and classical logics—that have geometric Kripke semantics, which we call ...
Rothenberg, Robert
core  

Greibach Normal Form in Algebraically Complete Semirings

, 2002
We give inequational and equational axioms for semirings with a fixed-point operator and formally develop a fragment of the theory of context-free languages.
Leiß, Hans, Ésik, Zoltán
core  

Combinatorics of Lazard elimination and interactions

, 2023
This memoir is all about rewriting of inversions in some product structures, reordering and their combinatorial counterparts for partition of alphabets i.e. Lazard’s elimination (LE) of generators and associated formulas (in particular their quotients). (
Nguyen Dinh, Vu
core   +1 more source

Experimental Comparison of Multi-Stage and One-Stage Contests [PDF]

This article experimentally studies a two-stage elimination contest and compares its performance with a one-stage contest. Contrary to the theory, the two-stage contest generates higher revenue than the equivalent one-stage contest.
Roman M. Sheremeta
core  

Timer formulas and decidable metric temporal logic

, 2005
We define a quantitative temporal logic that is based on a simple modality within the framework of monadic predicate logic. Its canonical model is the real line (and not an ω-sequence of some type).
Alexander Rabinovich, Hirshfeld, Yoram, Yoram Hirshfeld, Rabinovich, Alexander   +3 more
core   +1 more source