English
Related papers

Related papers: Weyl's Predicative Classical Mathematics as a Logi…

200 papers

In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…

Logic in Computer Science · Computer Science 2019-05-15 Marcelo Finger

This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules, which constitutes the algebraic version of the vector bundles in differential geometry. We adopt the…

Commutative Algebra · Mathematics 2019-05-08 Henri Lombardi , Claude Quitté

In this paper, we define an intuitionistic version of Computation Tree Logic. After explaining the semantic features of intuitionistic logic, we examine how these characteristics can be interesting for formal verification purposes.…

Logic in Computer Science · Computer Science 2023-10-05 Davide Catta , Vadim Malvone , Aniello Murano

The Countable Telescope Conjecture arose in the framework of stable homotopy theory, as a tool conceived to study the chromatic filtration. It turned out, however, to trigger extremely fertile research within the framework of Module…

Rings and Algebras · Mathematics 2022-01-26 P. F. Pacchiarotti

In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…

Logic · Mathematics 2024-12-11 Thierry Coquand , Henri Lombardi , Stefan Neuwirth

We develop a classical propositional logic for reasoning about combinatory logic. We define its syntax, axiomatic system and semantics. The syntax and axiomatic system are presented based on classical propositional logic, with typed…

Logic · Mathematics 2022-12-14 Simona Kašterović , Silvia Ghilezan

We study Linear Temporal Logic Modulo Theories over Finite Traces (LTLfMT), a recently introduced extension of LTL over finite traces (LTLf) where propositions are replaced by first-order formulas and where first-order variables referring…

Artificial Intelligence · Computer Science 2023-08-01 Luca Geatti , Alessandro Gianola , Nicola Gigante , Sarah Winkler

The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…

Number Theory · Mathematics 2025-01-20 Stefan Ehbauer , Aleksandr Grishkov , Dmitry Logachev

Werner's set-theoretical model is one of the most intuitive models of ECC. It combines a functional view of predicative universes with a collapsed view of the impredicative sort Prop. However this model of Prop is so coarse that the…

Logic in Computer Science · Computer Science 2015-02-17 Masahiro Sato

I argue against the predominant view of Weyl's interpretation of the logical signs. Drawing on his correctness-first account of mathematical knowledge, I point out that, according to him, quantified statements generate conditional…

History and Overview · Mathematics 2025-12-19 Iulian D. Toader

A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…

Representation Theory · Mathematics 2015-05-18 Martin Rubey , Bruce W. Westbury

In a paper by the authors, the associative and the Lie algebras of Weyl type $A[D]=A\otimes F[D]$ were introduced, where $A$ is a commutative associative algebra with an identity element over a field $F$ of any characteristic, and $F[D]$ is…

Quantum Algebra · Mathematics 2007-05-23 Yucai Su , Kaiming Zhao

In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new \emph{binary} sequent calculi (each sequent is a pair of formulae) for…

Logic in Computer Science · Computer Science 2011-03-08 Zoran Majkic

Weyl modules were originally defined for affine Lie algebras by Chari and Pressley in \cite{CP}. In this paper we extend the notion of Weyl modules for a Lie algebra $\mathfrak{g} \otimes A$, where $\mathfrak{g}$ is any Kac-Moody algebra…

Representation Theory · Mathematics 2015-01-21 S. Eswara Rao , V. Futorny , Sachin S. Sharma

The loop Hecke algebra is a generalization of the Hecke algebra to the loop braid group, introduced by Damiani, Martin and Rowell. We give a new presentation of the loop Hecke algebra provided a mild condition on the parameter and give a…

Representation Theory · Mathematics 2025-07-18 Geoffrey Janssens , Abel Lacabanne , Léo Schelstraete , Pedro Vaz

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…

Logic in Computer Science · Computer Science 2022-03-15 Marcelo Fiore , Andrew M. Pitts , S. C. Steenkamp

This text is devoted to the theory of varieties, which provides an important tool, based in universal algebra, for the classification of regular languages. In the introductory section, we present a number of examples that illustrate and…

Formal Languages and Automata Theory · Computer Science 2021-11-19 Howard Straubing , Pascal Weil

Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…

Representation Theory · Mathematics 2023-01-09 Rudolf Tange

In this paper we continue the study of the higher-rank graphs associated to finite-dimensional complex semisimple Lie algebras, introduced by the author and R. Yuncken, whose construction relies on Kashiwara's theory of crystals. First we…

Combinatorics · Mathematics 2026-04-22 Marco Matassa

Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We…

Logic in Computer Science · Computer Science 2016-08-22 Maciej Zielenkiewicz , Aleksy Schubert