English
Related papers

Related papers: Dualized Simple Type Theory

200 papers

Large Language Models (LLMs) excel at many tasks but often falter on complex problems that require structured, multi-step reasoning. We introduce the Diagram of Thought (DoT), a framework that enables a single LLM to build and navigate a…

Computation and Language · Computer Science 2026-05-15 Yifan Zhang , Yang Yuan , Andrew Chi-Chih Yao

In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that…

Logic in Computer Science · Computer Science 2011-11-09 Frederic Dambreville

Large Language Models (LLMs) have demonstrated impressive capabilities in reasoning tasks, yet their reliance on static prompt structures and limited adaptability to complex scenarios remains a significant challenge. In this paper, we…

Artificial Intelligence · Computer Science 2025-07-09 Chengkun Cai , Xu Zhao , Haoliang Liu , Zhongyu Jiang , Tianfang Zhang , Zongkai Wu , Jenq-Neng Hwang , Lei Li

In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…

Artificial Intelligence · Computer Science 2020-04-24 Laura Giordano , Valentina Gliozzi , Antonio Lieto , Nicola Olivetti , Gian Luca Pozzato

We first present a Priestley-style dualitiy for the classes of algebras that are the algebraic counterpart of some congruential, finitary and filter-distributive logic with theorems. Then we analyze which properties of the dual spaces…

Logic · Mathematics 2025-10-14 María Esteban , Ramon Jansana

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

Within the theoretical framework of divergence-type theories (DTTs), we set up a consistent nonlinear hydrodynamical description of a conformal fluid in flat space-time. DTTs go beyond second-order (in velocity gradients) theories, and are…

High Energy Physics - Phenomenology · Physics 2010-04-30 J. Peralta-Ramos , E. Calzetta

We present a new temporal logic called Distribution Temporal Logic (DTL) defined over predicates of belief states and hidden states of partially observable systems. DTL can express properties involving uncertainty and likelihood that cannot…

Systems and Control · Computer Science 2013-10-31 Austin Jones , Mac Schwager , Calin Belta

This paper introduces a novel type theory and logic for probabilistic reasoning. Its logic is quantitative, with fuzzy predicates. It includes normalisation and conditioning of states. This conditioning uses a key aspect that distinguishes…

Logic in Computer Science · Computer Science 2025-04-02 Robin Adams , Bart Jacobs

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Logic in Computer Science · Computer Science 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

Programming Languages · Computer Science 2025-10-08 Qiancheng Fu , Hongwei Xi

The paper studies hereditarily complete superintuitionistic deductive systems, that is, the deductive system which logic is an extension of the intuitionistic propositional logic. It is proven that for deductive systems a criterion of…

Logic · Mathematics 2016-11-16 Alex Citkin

Garcia and Cimini study a type inference problem for the ITGL, an implicitly and gradually typed language with let-polymorphism, and develop a sound and complete inference algorithm for it. Soundness and completeness mean that, if the…

Programming Languages · Computer Science 2019-09-04 Yusuke Miyazaki , Taro Sekiyama , Atsushi Igarashi

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…

Logic in Computer Science · Computer Science 2022-07-01 Andrea Aler Tubella , Alessio Guglielmi

Whilst mathematicians assume classical reasoning principles by default they often context switch when working, restricting themselves to various forms of subclassical reasoning. This pattern is especially common amongst logicians and set…

Logic in Computer Science · Computer Science 2023-02-21 Martin Berger , Dominic P. Mulligan

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon

For many a natural deduction style logic there is a Hilbert-style logic that is equivalent to it in that it has the same theorems (i.e. valid judgements with empty contexts). For intuitionistic logic, the axioms of the equivalent…

Logic in Computer Science · Computer Science 2015-07-01 M. W. Bunder , W. M. J. Dekkers

We use the dissipative type theory (DTT) framework to solve for the evolution of conformal fluids in Bjorken and Gubser flows from isotropic initial conditions. The results compare well with both exact and other hydrodynamic solutions in…

Nuclear Theory · Physics 2020-05-15 Esteban Calzetta , Lucas Cantarutti

The propositional product logic is one of the basic fuzzy logics with continuous t-norms, exploiting the multiplication t-norm on the unit interval [0,1]. Our aim is to combine well-established automated deduction (theorem proving) with…

Logic in Computer Science · Computer Science 2023-10-25 Dusan Guller

In this paper we relate different formulations of the DPLL(T) procedure. The first formulation is based on a system of rewrite rules, which we denote DPLL(T). The second formulation is an inference system of, which we denote LKDPLL(T). The…

Logic in Computer Science · Computer Science 2012-04-24 Mahfuza Farooque , Stéphane Lengrand , Assia Mahboubi