Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mendes, João, Marcos, João, Terrematte, Patrick
Format:	Preprint
Publié:	2026
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On proving consistency of equational theories in Bounded Arithmetic
par: Beckmann, Arnold, et autres
Publié: (2022)

Did Turing prove the undecidability of the halting problem?
par: Hamkins, Joel David, et autres
Publié: (2024)

Wider systems for linear logic with fixed points: proof theory and complexity
par: Das, Anupam, et autres
Publié: (2026)

Intrinsic and relative characterization results for logics with negative modalities
par: de Groot, Jim, et autres
Publié: (2025)

On the existence of strong proof complexity generators
par: Krajicek, Jan
Publié: (2022)

A proof theory of (omega-)context-free languages, via non-wellfounded proofs
par: Das, Anupam, et autres
Publié: (2024)

Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
par: Ye, Kangfeng, et autres
Publié: (2023)

Non-wellfounded parsimonious proofs and non-uniform complexity
par: Acclavio, Matteo, et autres
Publié: (2024)

A proof-theoretic approach to abstract interpretation
par: D'Silva, Vijay, et autres
Publié: (2026)

A logic of judgmental existence and its relation to proof irrelevance
par: Pezlar, Ivo
Publié: (2024)

A linear proof language for second-order intuitionistic linear logic
par: Díaz-Caro, Alejandro, et autres
Publié: (2023)

Bijective proofs for Eulerian numbers of types B and D
par: Santocanale, Luigi
Publié: (2021)

The proof theory and semantics of second-order (intuitionistic) tense logic
par: Becker, Justus, et autres
Publié: (2026)

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

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
par: Oda, Yukihiro, et autres
Publié: (2021)

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

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates
par: Oda, Yukihiro, et autres
Publié: (2022)

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

On $NP \cap coNP$ proof complexity generators
par: Krajicek, Jan
Publié: (2025)

A proof theory of right-linear (omega-)grammars via cyclic proofs
par: Das, Anupam, et autres
Publié: (2024)

A concise proof of Commoner's theorem
par: Jancar, Petr
Publié: (2024)

Finite element method. Detailed proofs to be formalized in Coq
par: Clément, François, et autres
Publié: (2024)

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

Short proofs without interference
par: Rebola-Pardo, Adrian
Publié: (2025)

An ecumenical view of proof-theoretic semantics
par: Nascimento, Victor, et autres
Publié: (2023)

A precise proof of the n-variable Bekic principle
par: Xu, Jun
Publié: (2025)

On the role of connectivity in Linear Logic proofs
par: Di Donna, Raffaele, et autres
Publié: (2025)

Between proof construction and SAT-solving
par: Schubert, Aleksy, et autres
Publié: (2024)

FILO -- automated unification in $\mathcal{FL}_0$
par: Morawska, Barbara, et autres
Publié: (2025)

A syntactic proof of decidability for the logic of bunched implication BI
par: Ramanayake, Revantha
Publié: (2016)

Dyadic obligations: proofs and countermodels via hypersequents
par: Ciabattoni, Agata, et autres
Publié: (2024)

Computational expressivity of (circular) proofs with fixed points
par: Curzi, Gianluca, et autres
Publié: (2023)

Cyclic proof theory of positive inductive definitions
par: Curzi, Gianluca, et autres
Publié: (2025)

Cube-based Isomorph-free Finite Model Finding
par: Chow, Choiwah, et autres
Publié: (2025)

Compositional pre-processing for automated reasoning in dependent type theory
par: Blot, Valentin, et autres
Publié: (2022)

Leveraging Large Language Models to Boost Dafny's Developers Productivity
par: Silva, Álvaro, et autres
Publié: (2024)

Proof complexity of positive branching programs
par: Das, Anupam, et autres
Publié: (2021)

Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
par: Di Guardia, Rémi, et autres
Publié: (2026)

Birkhoff style proof systems for hybrid-dynamic quantum logic
par: Gaina, Daniel
Publié: (2024)

Sharing proofs with predicative theories through universe-polymorphic elaboration
par: Felicissimo, Thiago, et autres
Publié: (2023)