In mathematical logic, focused proofs are a family of analytic proofs that arise through goal-directed proof-search, and are a topic of study in structural proof theory and reductive logic. They form the most general definition of goal-directed proof-search—in which someone chooses a formula and performs hereditary reductions until the result meets some condition. The extremal case where reduction only terminates when axioms are reached forms the sub-family of uniform proofs.[1]

A sequent calculus is said to have the focusing property when focused proofs are complete for some terminating condition. For System LK, System LJ, and System LL, uniform proofs are focused proofs where all the atoms are assigned negative polarity.[2] Many other sequent calculi has been shown to have the focusing property, notably the nested sequent calculi of both the classical and intuitionistic variants of the modal logics in the S5 cube.[3][4]

Uniform proofs

In the sequent calculus for an intuitionistic logic, the uniform proofs can be characterised as those in which the upward reading performs all right rules before the left rules. Typically, uniform proofs are not complete for the logic i.e., not all provable sequents or formulas admit a uniform proof, so one considers fragments where they are complete e.g., the hereditary Harrop fragment of intuitionistic logic. Due to the deterministic behaviour, uniform proof-search has been used as the control mechanism defining the programming language paradigm of logic programming.[1] Occasionally, uniform proof-search is implemented in a variant of the sequent calculus for the given logic where context management is automatic, thereby increasing the fragment for which one can define a logic programming language.[5]

Focused proofs

The focusing principle was originally classified through the disambiguation between synchronous and asynchronous connectives in linear logic i.e., connectives that interact with the context and those that do not, as a consequence of research on logic programming. They are now an increasingly important example of control in reductive logic, and can drastically improve proof-search procedures in industry. The essential idea of focusing is to identify and coalesce the non-deterministic choices in a proof, so that a proof can be seen as an alternation of negative phases (where invertible rules are applied eagerly) and positive phases (where applications of the other rules are confined and controlled).[3]

Polarisation

According to the rules of the sequent calculus, formulas are canonically put into one of two classes called positive and negative e.g., in LK and LJ the formula is positive. The only freedom is over atoms, which are assigned a polarity freely. For negative formulas, provability is invariant under the application of a right rule; and, dually, for a positive formulas provability is invariant under the application of a left rule. In either case one can safely apply rules in any order to hereditary sub-formulas of the same polarity.

In the case of a right rule applied to a positive formula, or a left rule applied to a negative formula, one may result in invalid sequents e.g., in LK and LJ there is no proof of the sequent beginning with a right rule. A calculus admits the focusing principle if when an original reduct was provable then the hereditary reducts of the same polarity are also provable. That is, one can commit to focusing on decomposing a formula and its sub-formulas of the same polarity without loss of completeness.

Focused system

A sequent calculus is often shown to have the focusing property by working in a related calculus where polarity explicitly controls which rules apply. Proofs in such systems are in focused, unfocused, or neutral phases, where the first two are characterised by hereditary decomposition; and the latter by forcing a choice of focus. One of the most important operational behaviours a procedure can undergo is backtracking i.e., returning to an earlier stage in the computation where a choice was made. In focused systems for classical and intuitionistic logic, the use of backtracking can be simulated by pseudo-contraction.

Let and denote change of polarity, the former making a formula negative, and the latter positive; and call a formula with an arrow neutral. Recall that is positive, and consider the neutral polarized sequent , which is interpreted as the actual sequent . For neutral sequents such as this, the focused system forces one to make an explicit choice of which formula to focus on, denoted by . To perform a proof-search the best thing is to choose the left formula, since is positive, indeed (as discussed above) in some cases there are no proofs where the focus is on the right formula. To overcome this, some focused calculi create a backtracking point such that focusing on the right yields , which is still as . The second formula on the right can be removed only when the focused phase has finished, but if proof-search gets stuck before this happens the sequent may remove the focused component thereby returning to the choice e.g., must be taken to as no other reductive inference can be made. This is a pseudo-contraction since it has the syntactic form of a contraction on the right, but the actual formula doesn't exist i.e., in the interpretation of the proof in the focused system the sequent has only one formula on the right.

References

  1. 1 2 Miller, Dale; Nadathur, Gopalan; Pfenning, Frank; Scedrov, Andre (1991-03-14). "Uniform proofs as a foundation for logic programming". Annals of Pure and Applied Logic. 51 (1): 125–157. doi:10.1016/0168-0072(91)90068-W. ISSN 0168-0072.
  2. ↑ Liang, Chuck; Miller, Dale (2009-11-01). "Focusing and polarization in linear, intuitionistic, and classical logics". Theoretical Computer Science. Abstract Interpretation and Logic Programming: In honor of professor Giorgio Levi. 410 (46): 4747–4768. CiteSeerX 10.1.1.160.8967. doi:10.1016/j.tcs.2009.07.041. ISSN 0304-3975.
  3. 1 2 Chaudhuri, Kaustuv; Marin, Sonia; Straßburger, Lutz (2016), Jacobs, Bart; Löding, Christof (eds.), "Focused and Synthetic Nested Sequents", Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, vol. 9634, pp. 390–407, doi:10.1007/978-3-662-49630-5_23, ISBN 978-3-662-49629-9
  4. ↑ Chaudhuri, Kaustuv; Marin, Sonia; Straßburger, Lutz (2016). Modular Focused Proof Systems for Intuitionistic Modal Logics. Leibniz International Proceedings in Informatics (LIPIcs). Vol. 52. Marc Herbstritt. pp. 16:1–16:18. doi:10.4230/LIPICS.FSCD.2016.16. ISBN 9783959770101.
  5. ↑ Armelín, Pablo A.; Pym, David J. (2001), "Bunched Logic Programming", Automated Reasoning, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 289–304, doi:10.1007/3-540-45744-5_21, ISBN 978-3-540-42254-9
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.