Related papers: Valuations in G\"{o}del Logic, and the Euler Chara…

We prove necessary optimality conditions of Euler-Lagrange type for generalized problems of the calculus of variations on time scales with a Lagrangian depending not only on the independent variable, an unknown function and its delta…

Understanding the notion of a model is not always easy in logic courses. Hence, tools such as Euler diagrams are frequently applied as informal illustrations of set-theoretical models. We formally investigate Euler diagrams as an…

Classical Decision Theory provides a normative framework for representing and reasoning about complex preferences. Straightforward application of this theory to automate decision making is difficult due to high elicitation cost. In response…

In this paper, we study model-checking of linear-time properties in multi-valued systems. Safety property, invariant property, liveness property, persistence and dual-persistence properties in multi-valued logic systems are introduced. Some…

We establish some properties of \'etoiles and associated valuations over complex analytic spaces, showing that Abhyankar's inequality holds. We give some examples of pathological behavior of these valuations. We prove a regularization…

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

We discuss the notion of linearization through examples, which include the Price map, PageRank, representation theory, the Euler characteristic and quantum invariants. We also review categorification, which adds an additional layer of…

In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_{\Delta} classes). Classical results of this flavour include…

The Euler characteristic $\chi =|V|-|E|$ and the total length $\mathcal{L}$ are the most important topological and geometrical characteristics of a metric graph. Here, $|V|$ and $|E|$ denote the number of vertices and edges of a graph. The…

The constant $\pi$ has fascinated scholars throughout the centuries, inspiring numerous formulas for its evaluation, such as infinite sums and continued fractions. Despite their individual significance, many of the underlying connections…

We develop a bottom-up approach to truth-value semantics for classical logic of partial terms based on equality and apply it to prove the conservativity of the addition of partial description and partial selection functions, independently…

The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These…

Definite descriptions are phrases of the form 'the $x$ such that $\varphi$', used to refer to single entities in a context. They are often more meaningful to users than individual names alone, in particular when modelling or querying data…

We ask, when is a property of a model a logical property? According to the so-called Tarski-Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics…

Given a discrete group $G$ with a finite model for $\underline{E}G$, we study $K(n)^*(BG)$ and $E^*(BG)$, where $K(n)$ is the $n$-th Morava $K$-theory for a given prime and $E$ is the height $n$ Morava $E$-theory. In particular we…

In this paper we present the first-order logic QLETF+, a quantified version of the logic LETF+, introduced in Coniglio and Rodrigues (Studia Logica 112:561-606, 2024). QLETF+ exhibits several properties that are not always enjoyed by logics…

For every univariate formula $\chi$ we introduce a lattices of intermediate theories: the lattice of $\chi$-logics. The key idea to define chi-logics is to interpret atomic propositions as fixpoints of the formula $\chi^2$, which can be…

First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those…

We discuss properties of the complete Euler characteristic of a group G of type FP over the complex numbers and we relate it to the L2-Euler characteristic of the centralizers of the elements of G.

A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…