Results 261 to 270 of about 699,995 (283)

Refutation of Sallé's Longstanding Conjecture

International Conference on Formal Structures for Computation and Deduction, 2017
The ⁄-calculus possesses a strong notion of extensionality, called “the Ê-rule”, which has been the subject of many investigations. It is a longstanding open problem whether the equivalence obtained by closing the theory of Böhm trees under the Ê-rule is
B. Intrigila, Giulio Manzonetto, A. Polonsky   +2 more
semanticscholar   +1 more source

The Power of the Filtration Technique for Modal Logics with Team Semantics

Annual Conference for Computer Science Logic, 2017
Modal Team Logic (MTL) extends Väänänen’s Modal Dependence Logic (MDL) by Boolean negation. Its satisfiability problem is decidable, but the exact complexity is not yet understood very well.
Martin Lück
semanticscholar   +1 more source

Precongruences and Parametrized Coinduction for Logics for Behavioral Equivalence

Conference on Algebra and Coalgebra in Computer Science, 2017
We present a new proof system for equality of terms which present elements of the final coalgebra of a finitary set functor. This is most important when the functor is finitary, and we improve on logical systems which have already been proposed in ...
David Sprunger, L. Moss
semanticscholar   +1 more source

Fast(er) Reasoning in Interval Temporal Logic

Annual Conference for Computer Science Logic, 2017
Clausal forms of logics are of great relevance in Artificial Intelligence, because they couple a high expressivity with a low complexity of reasoning problems.
D. Bresolin, Emilio Muñoz-Velasco, G. Sciavicco   +2 more
semanticscholar   +1 more source

The Model-Theoretic Expressiveness of Propositional Proof Systems

Annual Conference for Computer Science Logic, 2017
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded width resolution, and the ...
E. Grädel, Benedikt Pago, Wied Pakusa
semanticscholar   +1 more source

On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)

International Symposium on Mathematical Foundations of Computer Science, 2017
This is an overview of the invited talk delivered at the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017).
Michał Pilipczuk
semanticscholar   +1 more source

Restricted Positive Quantification Is Not Elementary

Types for Proofs and Programs, 2014
We show that a restricted variant of constructive predicate logic with positive (covariant) quantification is of super-elementary complexity. The restriction is to limit the number of eigenvariables used in quantifier introductions rules to a reasonably ...
Aleksy Schubert, P. Urzyczyn, Daria Walukiewicz-Chrzaszcz   +2 more
semanticscholar   +1 more source

f......... ■ indication of yes/no forced ch. forced ch. yes/no response dilution steps 1.5-23 * 21.6 exposure time <15 sec 10 sec <15 sec 20 sec stimulus interval 15 sec 3 min 1 min 1 min Table 2:Detection method, indication of response and size of stimulus intervals. 4.1 Definition of odor threshold By convention the individual odor threshold is that concentration which is just perceived by the subject in 50% of the cases in which it is presented to him. The group threshold is the …

, 1986
Ing. W. Kroodsma
openalex   +1 more source

4.1 Drucktext Liebelei. Erstes Bild (DT) [f Tanzschule]

, 2014

openalex   +1 more source

History of Agrophysics: Journal Version of the Book "N. F. Bondarenko" (Part 4.1)

, 2019
Dmitry Kurtener, Anna Krueger
openalex   +1 more source