Learning algorithms versus automatability of Frege systems
We connect learning algorithms and algorithms automating proof search in propositional proof systems: for every sufficiently strong, well-behaved propositional proof system P, we prove that the following statements are equivalent,<br> - Provable learning. P proves efficiently that p-size circu...
Główni autorzy: | Pich, J, Santhanam, R |
---|---|
Format: | Conference item |
Język: | English |
Wydane: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2022
|
Podobne zapisy
-
Frege systems for quantified Boolean logic
od: Beyersdorff, O, i wsp.
Wydane: (2020) -
Frege's Choice
od: Junyeol Kim
Wydane: (2021-05-01) -
Frege’s Bedeutung
od: Jonas Dagys
Wydane: (2020-04-01) -
Frege's paradox.
od: Mendelsohn, Richard Lloyd, i wsp.
Wydane: (2009) -
Frege’s Conceptions of Elucidation
od: Wim Vanrie
Wydane: (2024-12-01)