Related papers: Integration motivique sur les schemas formels
Graph rewrite formalisms are a powerful approach to modeling complex molecular systems. They capture the intrinsic concurrency of molecular interactions, thereby enabling a formal notion of mechanism (a partially ordered set of events) that…
Combinatorial design theory studies set systems with certain balance and symmetry properties and has applications to computer science and elsewhere. This paper presents a modular approach to formalising designs for the first time using…
Safety and assurance standards often rely on the principle that requirements errors can be minimised by expressing the requirements more formally. Although numerous case studies have shown that the act of formalising previously informal…
Computability logic is a formal theory of (interactive) computability in the same sense as classical logic is a formal theory of truth. This approach was initiated very recently in "Introduction to computability logic" (Annals of Pure and…
We present a theoretical and a numerical formalism for analysis and design of spintronic integrated circuits (SPINICs). The formalism encompasses a generalized circuit theory for spintronic integrated circuits based on nanomagnetic dynamics…
Formal (mixed) Hodge structures FHS are introduced in such a way that the Hodge realization of Deligne's 1-motives extends to a realization from Laumon's 1-motives to formal Hodge structures of level 1, providing an equivalence of…
This technical report investigates Kripke-style modal type theories, both simply typed and dependently typed. We examine basic meta-theories of the type theories, develop their substitution calculi, and give normalization by evaluation…
In this work we develop some categorical aspects of the double structure of a module.
The integration of reasoning and computation services across system and language boundaries is a challenging problem of computer science. In this paper, we use integration for the scenario where we have two systems that we integrate by…
We prove convergence results for `increasing' sequences of sectorial forms. We treat both the case of closed forms and the case of non-closable forms.
We associate canonical virtual motives to definable sets over a field of characteristic zero. We use this construction to show that very general p-adic integrals are canonically interpolated by motivic ones.
A new kind of diagrams is presented, showing the causal structure of bimetric interactions.
The paper presents a software tool for analysis and interactive engagement in various logical reasoning tasks. A first feature of the program consists in providing an interface for working with logic-specific repositories of formal…
We introduce a complete many-valued semantics for basic normal lattice-based modal logic. This relational semantics is grounded on many-valued formal contexts from Formal Concept Analysis. We discuss an interpretation and possible…
Natural language semantics has recently sought to combine the complementary strengths of formal and distributional approaches to meaning. More specifically, proposals have been put forward to augment formal semantic machinery with…
In this paper, we produce a cellular motivic spectrum of motivic modular forms over $\R$ and $\C$, answering positively to a conjecture of Dan Isaksen. This spectrum is constructed to have the appropriate cohomology, as a module over the…
Formal deductive systems are very common in computer science. They are used to represent logics, programming languages, and security systems. Moreover, writing programs that manipulate them and that reason about them is important and…
Computational modelling offers a powerful tool for formalising psychological theories, making them more transparent, testable, and applicable in digital contexts. Yet, the question often remains: how should one computationally model a…
Following the work of Gangl, Goncharov and Levin in [GGL], we will give a combinatorial framework for motivic study of iterated integrals on the affine line. We will show that under a certain genericity condition these combinatorial objects…
This paper reports on the results of the French ANR IMPEX research project dealing with making explicit domain knowledge in design models. Ontologies are formalised as theories with sets, axioms, theorems and reasoning rules. They are…