Logical Foundations of Proof Complexity

Author(s):  
Stephen Cook ◽  
Phuong Nguyen
2016 ◽  
Author(s):  
David Barner

Perceptual representations – e.g., of objects or approximate magnitudes –are often invoked as building blocks that children combine with linguisticsymbols when they acquire the positive integers. Systems of numericalperception are either assumed to contain the logical foundations ofarithmetic innately, or to supply the basis for their induction. Here Ipropose an alternative to this general framework, and argue that theintegers are not learned from perceptual systems, but instead arise toexplain perception as part of language acquisition. Drawing oncross-linguistic data and developmental data, I show that small numbers(1-4) and large numbers (~5+) arise both historically and in individualchildren via entirely distinct mechanisms, constituting independentlearning problems, neither of which begins with perceptual building blocks.Specifically, I propose that children begin by learning small numbers(i.e., *one, two, three*) using the same logical resources that supportother linguistic markers of number (e.g., singular, plural). Several yearslater, children discover the logic of counting by inferring the logicalrelations between larger number words from their roles in blind countingprocedures, and only incidentally associate number words with perception ofapproximate magnitudes, in an *ad hoc* and highly malleable fashion.Counting provides a form of explanation for perception but is not causallyderived from perceptual systems.


2021 ◽  
Vol 13 (1) ◽  
pp. 1-25
Author(s):  
Dmitry Itsykson ◽  
Alexander Okhotin ◽  
Vsevolod Oparin

The partial string avoidability problem is stated as follows: given a finite set of strings with possible “holes” (wildcard symbols), determine whether there exists a two-sided infinite string containing no substrings from this set, assuming that a hole matches every symbol. The problem is known to be NP-hard and in PSPACE, and this article establishes its PSPACE-completeness. Next, string avoidability over the binary alphabet is interpreted as a version of conjunctive normal form satisfiability problem, where each clause has infinitely many shifted variants. Non-satisfiability of these formulas can be proved using variants of classical propositional proof systems, augmented with derivation rules for shifting proof lines (such as clauses, inequalities, polynomials, etc.). First, it is proved that there is a particular formula that has a short refutation in Resolution with a shift rule but requires classical proofs of exponential size. At the same time, it is shown that exponential lower bounds for classical proof systems can be translated for their shifted versions. Finally, it is shown that superpolynomial lower bounds on the size of shifted proofs would separate NP from PSPACE; a connection to lower bounds on circuit complexity is also established.


2002 ◽  
Vol 2 (4-5) ◽  
pp. 423-424 ◽  
Author(s):  
MAURICE BRUYNOOGHE ◽  
KUNG-KIU LAU

This special issue marks the tenth anniversary of the LOPSTR workshop. LOPSTR started in 1991 as a workshop on Logic Program Synthesis and Transformation, but later it broadened its scope to logic-based Program Development in general.The motivating force behind LOPSTR has been a belief that declarative paradigms such as logic programming are better suited to program development tasks than traditional non-declarative ones such as the imperative paradigm. Specification, synthesis, transformation or specialisation, analysis, verification and debugging can all be given logical foundations, thus providing a unifying framework for the whole development process.In the past ten years or so, such a theoretical framework has indeed begun to emerge. Even tools have been implemented for analysis, verification and specialisation. However, it is fair to say that so far the focus has largely been on programming-in-the-small. So the future challenge is to apply or extend these techniques to programming-in-the-large, in order to tackle software engineering in the real world.


2011 ◽  
Vol 20 (1) ◽  
pp. 51-85 ◽  
Author(s):  
Stefan Dantchev ◽  
Barnaby Martin ◽  
Stefan Szeider
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document