A method for the automated generation of proof exercises with comparable levels of proving complexity

Documenti analoghi

• On proving consistency of equational theories in Bounded Arithmetic
  di: Beckmann, Arnold, et al.
  Pubblicazione: (2022)
• Did Turing prove the undecidability of the halting problem?
  di: Hamkins, Joel David, et al.
  Pubblicazione: (2024)
• Wider systems for linear logic with fixed points: proof theory and complexity
  di: Das, Anupam, et al.
  Pubblicazione: (2026)
• Intrinsic and relative characterization results for logics with negative modalities
  di: de Groot, Jim, et al.
  Pubblicazione: (2025)
• On the existence of strong proof complexity generators
  di: Krajicek, Jan
  Pubblicazione: (2022)