Feasible disjunction for random resolution

πŸ“… 2026-09-07
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF
πŸ€– AI Summary
η ”η©Άθ―ζ˜ŽδΊ†ιšζœΊεˆ†θΎ¨ηš„δΈ€η§ζ›΄εΌΊη‰ˆζœ¬ε…·ζœ‰ε―θ‘Œζžε–ζ€§θ΄¨οΌŒθΏ™ζ˜―ι¦–δΈͺζœͺηŸ₯ζ˜―ε¦ε…·ζœ‰ε―θ‘Œζ’ε€Όζ€§θ΄¨δ½†ε…·ε€‡ε―θ‘Œζžε–ζ€§θ΄¨ηš„θ―ζ˜Žη³»η»Ÿγ€‚
πŸ“ Abstract
We show that a (stronger) version of random resolution has the feasible disjunction property. This is the first instance of a proof system not known to have feasible interpolation, which nevertheless has the feasible disjunction property.
Problem

Research questions and friction points this paper is trying to address.

random resolution
feasible disjunction property
proof system
Innovation

Methods, ideas, or system contributions that make the work stand out.

random resolution
feasible disjunction property
proof system
πŸ”Ž Similar Papers
No similar papers found.
T
Theodoros Papamakarios
Institute of Mathematics of the Czech Academy of Sciences