GBGabriele Buriola

Gabriele Buriola

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Gabriele Buriola has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Ordinal analysis of well-ordering principles, well quasi-orders closure properties, and Σn-collection schema

    by Gabriele Buriola, Andreas Weiermann

    The study of well quasi-orders ( wqo ) is a relevant part of combinatorics and within wqo theory Kruskal’s theorem plays a crucial role. Extending previous proof-theoretic results, we calculate the [Formula: see text] ordinals of two different versions of labeled Kruskal’s theorem: [Formula: see text] and [Formula: see text] denoting, respectively, all the cases of labeled Kruskal’s theorem for trees with an upper bound on the branching degree, and the standard Kruskal’s theorem for labeled trees. [Formula: see text]In order to reach these computations, a key step is to move from Kruskal’s theorem, which regards preservation of wqo ’s, to an equivalent Well-Ordering Principle (WOP), regarding instead preservation of well-orders. Given an ordinal function [Formula: see text], WOP[Formula: see text] amounts to the following principle [Formula: see text], where WO[Formula: see text] states that “[Formula: see text] is a well-order”. In our case, the two ordinal functions involved are [Formula: see text] and [Formula: see text]. [Formula: see text]In addition to the ordinal analysis of Kruskal’s theorem and its related WOP, a series of Well Quasi-orders Principles (WQP) is considered. Given a set operation [Formula: see text] that preserves the property of being a wqo , its Well Quasi-orders Principle, WQP[Formula: see text], is given by the statement [Formula: see text]. Conducting this study, unexpected connections with different principles arising from Ramsey and Computational theory, such as RT[Formula: see text], CAC, ADS, RT[Formula: see text], turn up. [Formula: see text]Lastly, extending and combining previous results, we also obtain the ordinal analysis of the collection schema [Formula: see text] within a weak base theory.


  • PROOF-THEORETIC RELATIONS BETWEEN HIGMAN’S AND KRUSKAL’S THEOREM, AND INDEPENDENCE RESULTS FOR TREE-LIKE STRUCTURES

    by Gabriele Buriola, Andreas Weiermann

    Higman’s lemma and Kruskal’s theorem are two of the most celebrated results in the theory of well quasi-orders. In his seminal paper G. Higman obtained what is known as Higman’s lemma as a corollary of a more general theorem, dubbed here as Higman’s theorem. While the lemma deals with finite sequences over a well quasi-order, the theorem is about abstract operations of arbitrarily high arity. J. B. Kruskal was fully aware of this broader framework: in his seminal paper, he not only applied Higman’s lemma at crucial points of his proof but also followed Higman’s proof schema. At the conclusion of the article, Kruskal noted that Higman’s theorem is a special case—restricted to trees of finite degree—of his own tree theorem. Although he provided no formal reduction, he included a glossary translating concepts between the tree and algebraic settings. The equivalence between these versions was later clarified by D. Schmidt and M. Pouzet. In this work, we revisit that equivalence to illuminate the proof-theoretical relationships between the two theorems within the base system RCA 0 $_0$ Subscript 0 of reverse mathematics. Moreover, some independence results over first- and second-order theories are treated. In particular, tree-like structures, involving either Ackermannian terms or exponential expressions, are studied unveiling well-foundedness properties that are independent from Peano arithmetic and relevant fragments of second-order arithmetic.

  • Open Access

    Well quasi-orders, better quasi-orders, and monomial ideals

    by Gabriele Buriola, Peter Schuster

    Besides a self-contained introduction into well quasi-orders and better quasi-orders, the focus is on how these concepts lead in a neat and quick way to some well-known facts regarding monomials and monomial ideals of a polynomial ring over a field. Not uninteresting connections emerge, such as a direct path to Dickson’s lemma for monomial ideals from Higman’s theorem for monoids of terms in the vein of Hilbert’s basis theorem in iterative form.


  • Open Access

    Decision algorithms for fragments of real analysis. III: A theory of differentiable functions with (semi-)open intervals

    by G. Buriola, D. Cantone, G. Cincotti, E. G. Omodeo, G. T. Spartà

    This paper enriches preexisting satisfiability tests for unquantified languages, which in turn augment a fragment of Tarski's elementary algebra with unary real functions possessing a continuous first derivative. Two sorts of individual variables are available, one ranging over real numbers and the other one ranging over the functions of interest. Numerical terms are built from real variables through constructs designating the four basic arithmetic operations and through the function-application constructs $f(t)$ and $D[\,f\,](t)$, where $f$ stands for a function variable, $t$ for a numerical term, and $D[\,\sqdot\,]$ designates the differentiation operator. Comparison relators can be placed between numerical terms. An array of predicate symbols are also available, designating various relationships between functions, as well as function properties, that may hold over intervals of the real line; those are: (pointwise) function comparisons, strict and nonstrict monotonicity~/~convexity~/~concavity properties, comparisons between the derivative of a function and a real term--here, w.r.t.\ earlier research, they are extended to (semi)-open intervals. The decision method we propose consists in preprocessing the given formula into an equisatisfiable quantifier-free formula of the elementary algebra of real numbers, whose satisfiability can then be checked by means of Tarski's decision method. No direct reference to functions will appear in the target formula, each function variable having been superseded by a collection of stub real variables; hence, in order to prove that the proposed translation is satisfiability-preserving, we must figure out a sufficiently flexible family of interpolating $C^1$ functions that can accommodate a model for the source formula whenever the target formula turns out to be satisfiable.

  • Open Access

    Explainability by design: an experimental analysis of the legal coding process

    by Matteo Cristani, Guido Governatori, Francesco Olivieri, Monica Palmirani, Gabriele Buriola

    Behind a set of rules in Deontic Defeasible Logic, there is a mapping process of normative background fragments. This process goes from text to rules and implicitly encompasses an explanation of the coded fragments. In this paper we deliver a methodology for \textit{legal coding} that starts with a fragment and goes onto a set of Deontic Defeasible Logic rules, involving a set of \textit{scenarios} to test the correctness of the coded fragments. The methodology is illustrated by the coding process of an example text. We then show the results of a series of experiments conducted with humans encoding a variety of normative backgrounds and corresponding cases in which we have measured the efforts made in the coding process, as related to some measurable features. To process these examples, a recently developed technology, Houdini, that allows reasoning in Deontic Defeasible Logic, has been employed. Finally we provide a technique to forecast time required in coding, that depends on factors such as knowledge of the legal domain, knowledge of the coding processes, length of the text, and a measure of \textit{depth} that refers to the length of the paths of legal references.

  • A decidable theory involving addition of differentiable real functions

    by Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio G. Omodeo, Gaetano T. Spartà