English
Related papers

Related papers: IKP and Friends

200 papers

The intuitionistic modal logics considered between Constructive K (CK) and Intuitionistic K (IK) differ in their treatment of the possibility (diamond) connective. It was recently rediscovered that some logics between CK and IK also…

Logic in Computer Science · Computer Science 2025-04-23 Jim de Groot , Ian Shillito , Ranald Clouston

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

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

We undertake a local analysis of combinatorial independence as it connects to topological entropy within the framework of actions of sofic groups.

Dynamical Systems · Mathematics 2013-01-08 David Kerr , Hanfeng Li

This paper discusses causal independence models and a generalization of these models called causal interaction models. Causal interaction models are models that have independent mechanisms where a mechanism can have several causes. In…

Artificial Intelligence · Computer Science 2015-05-19 Christopher Meek , David Heckerman

A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…

Logic · Mathematics 2018-04-18 Daniel Palacín , Saharon Shelah

The general theory of Grothendieck categories is presented. We systemize the principle methods and results of the theory, showing how these results can be used for studying rings and modules.

Category Theory · Mathematics 2007-05-23 Grigory Garkusha

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

The separately continuity topology is considered and some its properties are investigated. With help of these properties a generalization of Sierpinski theorem on determination of real separately continuous function by its values on an…

General Topology · Mathematics 2016-01-28 V. V. Mykhaylyuk

We introduce an independence criterion based on entropy regularized optimal transport. Our criterion can be used to test for independence between two samples. We establish non-asymptotic bounds for our test statistic and study its…

Machine Learning · Statistics 2022-04-21 Lang Liu , Soumik Pal , Zaid Harchaoui

In recent years, a new class of models for multi-agent epistemic logic has emerged, based on simplicial complexes. Since then, many variants of these simplicial models have been investigated, giving rise to different logics and…

Logic in Computer Science · Computer Science 2023-04-27 Eric Goubault , Roman Kniazev , Jérémy Ledent , Sergio Rajsbaum

We prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. Iosevich , I. Laba

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…

Logic · Mathematics 2023-03-21 Davide Emilio Quadrellaro

We introduce the concept of access-based intuitionistic knowledge which relies on the intuition that agent $i$ knows $\varphi$ if $i$ has found access to a proof of $\varphi$. Basic principles are distribution and factivity of knowledge as…

Logic in Computer Science · Computer Science 2021-02-25 Steffen Lewitzka

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…

Logic in Computer Science · Computer Science 2017-07-28 Ivano Ciardelli , Martin Otto

In this paper, we develop differential twisted K-theory and define a twisted Chern character on twisted K-theory which depends on a choice of connection and curving on the twisting gerbe. We also establish the general Riemann-Roch theorem…

K-Theory and Homology · Mathematics 2008-09-28 Alan L. Carey , Jouko Mickelsson , Bai-Ling Wang

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Logic · Mathematics 2012-02-14 Artem Chernikov , Pierre Simon

We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…

Logic · Mathematics 2019-01-28 Sergey Sudoplatov

Categorization systems are widely studied in psychology, sociology, and organization theory as information-structuring devices which are critical to decision-making processes. In the present paper, we introduce a sound and complete…

Logic in Computer Science · Computer Science 2017-07-28 Willem Conradie , Sabine Frittella , Alessandra Palmigiano , Michele Piazzai , Apostolos Tzimoulis , Nachoem M. Wijnberg

We propose an extension of Poole's independent choice logic based on a relaxation of the underlying independence assumptions. A credal semantics involving multiple joint probability mass functions over the possible worlds is adopted. This…

Logic in Computer Science · Computer Science 2018-06-22 Alessandro Antonucci , Alessandro Facchini
‹ Prev 1 4 5 6 7 8 10 Next ›