Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Mendes, João, Marcos, João, Terrematte, Patrick
Formato:	Preprint
Publicado:	2026
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On proving consistency of equational theories in Bounded Arithmetic
por: Beckmann, Arnold, et al.
Publicado: (2022)

Did Turing prove the undecidability of the halting problem?
por: Hamkins, Joel David, et al.
Publicado: (2024)

Wider systems for linear logic with fixed points: proof theory and complexity
por: Das, Anupam, et al.
Publicado: (2026)

Intrinsic and relative characterization results for logics with negative modalities
por: de Groot, Jim, et al.
Publicado: (2025)

On the existence of strong proof complexity generators
por: Krajicek, Jan
Publicado: (2022)

A proof theory of (omega-)context-free languages, via non-wellfounded proofs
por: Das, Anupam, et al.
Publicado: (2024)

Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
por: Ye, Kangfeng, et al.
Publicado: (2023)

Non-wellfounded parsimonious proofs and non-uniform complexity
por: Acclavio, Matteo, et al.
Publicado: (2024)

A proof-theoretic approach to abstract interpretation
por: D'Silva, Vijay, et al.
Publicado: (2026)

A logic of judgmental existence and its relation to proof irrelevance
por: Pezlar, Ivo
Publicado: (2024)

A linear proof language for second-order intuitionistic linear logic
por: Díaz-Caro, Alejandro, et al.
Publicado: (2023)

Bijective proofs for Eulerian numbers of types B and D
por: Santocanale, Luigi
Publicado: (2021)

The proof theory and semantics of second-order (intuitionistic) tense logic
por: Becker, Justus, et al.
Publicado: (2026)

A comparison of three kinds of monotonic proof-theoretic semantics and the base-incompleteness of intuitionistic logic
por: d'Aragona, Antonio Piccolomini
Publicado: (2025)

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
por: Oda, Yukihiro, et al.
Publicado: (2021)

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
por: Oda, Yukihiro
Publicado: (2025)

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates
por: Oda, Yukihiro, et al.
Publicado: (2022)

Generalisation of proof simulation procedures for Frege systems by M.L.~Bonet and S.R.~Buss
por: Kozhemiachenko, Daniil
Publicado: (2024)

On $NP \cap coNP$ proof complexity generators
por: Krajicek, Jan
Publicado: (2025)

A proof theory of right-linear (omega-)grammars via cyclic proofs
por: Das, Anupam, et al.
Publicado: (2024)

A concise proof of Commoner's theorem
por: Jancar, Petr
Publicado: (2024)

Finite element method. Detailed proofs to be formalized in Coq
por: Clément, François, et al.
Publicado: (2024)

Towards solid abelian groups: A formal proof of Nöbeling's theorem
por: Asgeirsson, Dagur
Publicado: (2023)

Short proofs without interference
por: Rebola-Pardo, Adrian
Publicado: (2025)

An ecumenical view of proof-theoretic semantics
por: Nascimento, Victor, et al.
Publicado: (2023)

A precise proof of the n-variable Bekic principle
por: Xu, Jun
Publicado: (2025)

On the role of connectivity in Linear Logic proofs
por: Di Donna, Raffaele, et al.
Publicado: (2025)

Between proof construction and SAT-solving
por: Schubert, Aleksy, et al.
Publicado: (2024)

FILO -- automated unification in $\mathcal{FL}_0$
por: Morawska, Barbara, et al.
Publicado: (2025)

A syntactic proof of decidability for the logic of bunched implication BI
por: Ramanayake, Revantha
Publicado: (2016)

Dyadic obligations: proofs and countermodels via hypersequents
por: Ciabattoni, Agata, et al.
Publicado: (2024)

Computational expressivity of (circular) proofs with fixed points
por: Curzi, Gianluca, et al.
Publicado: (2023)

Cyclic proof theory of positive inductive definitions
por: Curzi, Gianluca, et al.
Publicado: (2025)

Cube-based Isomorph-free Finite Model Finding
por: Chow, Choiwah, et al.
Publicado: (2025)

Compositional pre-processing for automated reasoning in dependent type theory
por: Blot, Valentin, et al.
Publicado: (2022)

Leveraging Large Language Models to Boost Dafny's Developers Productivity
por: Silva, Álvaro, et al.
Publicado: (2024)

Proof complexity of positive branching programs
por: Das, Anupam, et al.
Publicado: (2021)

Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
por: Di Guardia, Rémi, et al.
Publicado: (2026)

Birkhoff style proof systems for hybrid-dynamic quantum logic
por: Gaina, Daniel
Publicado: (2024)

Sharing proofs with predicative theories through universe-polymorphic elaboration
por: Felicissimo, Thiago, et al.
Publicado: (2023)