English
Related papers

Related papers: Induction, Coinduction, and Fixed Points: Intuitio…

200 papers

A method of induction the distances with Hilbert structure is proposed. Some properties of the method are studied. Typical examples of corresponding metric spaces are discussed. Key words: Hilbert spaces; metric spaces; isometric embedding…

Functional Analysis · Mathematics 2018-04-27 Vesna Gotovac , Katerina Helisova , Lev B. Klebanov , Irina V. Volchenkova

We describe a way to represent computable functions between coinductive types as particular transducers in type theory. This generalizes earlier work on functions between streams by P. Hancock to a much richer class of coinductive types.…

Logic in Computer Science · Computer Science 2023-06-22 Pierre Hyvernat

Large language models are able to perform a task by conditioning on a few input-output demonstrations - a paradigm known as in-context learning. We show that language models can explicitly infer an underlying task from a few demonstrations…

Computation and Language · Computer Science 2022-05-24 Or Honovich , Uri Shaham , Samuel R. Bowman , Omer Levy

This chapter provides a tutorial overview of first principles methods to describe the properties of matter at the ground state or equilibrium. It begins with a brief introduction to quantum and statistical mechanics for predicting the…

Computational Engineering, Finance, and Science · Computer Science 2020-10-14 Jianzhong Wu , Mengyang Gu

These lecture notes give an introduction to the theory of interacting particle systems. The main subjects are the construction using generators and graphical representations, the mean field limit, stochastic order, duality, and the relation…

Probability · Mathematics 2025-11-10 Jan M. Swart

A fascinating hypothesis is that human and animal intelligence could be explained by a few principles (rather than an encyclopedic list of heuristics). If that hypothesis was correct, we could more easily both understand our own…

Machine Learning · Computer Science 2022-08-02 Anirudh Goyal , Yoshua Bengio

This article aims to explain essential elements of perturbation theory and their conceptual underpinnings. It is not meant as a summary of popular perturbation methods, though some illustrative examples are given to underline the main…

History and Overview · Mathematics 2022-12-15 Nicolas Fillion , Robert M. Corless

Our main aim in this paper is to introduce a general concept of multidimensional fixed point of a mapping in spaces with distance and establish various multidimensional fixed point results. This new concept simplifies the similar notion…

General Mathematics · Mathematics 2017-01-04 Mitrofan M. Choban , Vasile Berinde

We present the foundational theory of condensed sets and basic condensed algebra after having introduced key concepts from category theory and homological algebra. In the later sections, we indicate the relevance of condensed mathematics to…

Category Theory · Mathematics 2025-04-01 Noa Bihlmaier , Nick Ruoff , Philipp Schmale

Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…

Numerical Analysis · Computer Science 2014-12-11 Narendra Karmarkar

Theorem provers are tools that help users to write machine readable proofs. Some of this tools are also interactive. The need of such softwares is increasing since they provide proofs that are more certified than the hand written ones. Agda…

Logic in Computer Science · Computer Science 2020-02-18 Luca Ciccone

We propose an automated deduction method which allows us to produce proofs close to the human intuition and practice. This method is based on tableaux, which generate more natural proofs than similar methods relying on clausal forms, and…

Logic in Computer Science · Computer Science 2015-01-07 David Delahaye , Mélanie Jacquel

In this paper we investigate the complexity of abduction, a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining the world's behavior it aims at finding an explanation for some observed manifestation.…

Computational Complexity · Computer Science 2010-06-28 Nadia Creignou , Johannes Schmidt , Michael Thomas

We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…

Combinatorics · Mathematics 2013-03-05 Edinah K. Gnang , Patrick Devlin

The quantum mechanics formalism introduced new revolutionary concepts challenging our everyday perceptions. Arguably, quantum entanglement, which explains correlations that cannot be reproduced classically, is the most notable of them.…

We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract…

Logic in Computer Science · Computer Science 2023-07-25 Ulrich Berger , Hideki Tsuiki

This is a short note with some (very elementary) remarks concerning realization theory and the choice of inputs for identifying systems. Its goal is to bring some of these facts to the attention of the systems biology community.

Optimization and Control · Mathematics 2007-05-23 Eduardo D. Sontag

A pedagogical but concise overview of fiber bundles and their connections is provided, in the context of gauge theories in physics. The emphasis is on defining and visualizing concepts and relationships between them, as well as listing…

Differential Geometry · Mathematics 2022-08-19 Adam Marsh

We introduce two novel ideas related to the crosscut poset and give many examples of application of these ideas to the fixed point property.

Combinatorics · Mathematics 2022-05-17 Ana Gargantini , Miguel Ottina

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