نتایج جستجو برای: extensional
تعداد نتایج: 3340 فیلتر نتایج به سال:
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly for deciding satisfiability in various theories including lists, encryption, extensional arrays, extensional finite sets, and combinations of them. We also give a superposition-based decision procedure for homomorphism. 2003 Elsevier Science (USA). All rights reserved.
[1] The current structure of the South Armorican Domain in the French Variscan Belt, provides an excellent record of the late orogenic evolution, as documented by the complex interactions between extensional structures and partial melting. In the Golfe du Morbihan, the South Brittany Migmatite Belt (SBMB), tectonically overlain by non‐melted metamorphic units, was studied by combined structural...
Pliocene and Quaternary tectonic structures mainly consisting of segmented northwest–southeast normal faults, and associated seismicity in the central Betics do not agree with the transpressive tectonic nature of the Africa–Eurasia plate boundary in the Ibero-Maghrebian region. Active extensional deformation here is heterogeneous, individual segmented normal faults being linked by relay ramps a...
A graph G is said to be a set graph if it admits an acyclic orientation that is also extensional, in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the digraph representation of a hereditarily finite set. In this paper, we continue the study of set graphs and related topics, focusing on computational complexity as...
The speciication language Z is based on classical logic and extensional set theory. These are mathematical choices which are largely independent of Z and its calculus of schemata. This paper explores the possibilities of replacing classical logic with intuitionistic logic and extensional set theory with intensional set theory, and some of the consequences of these changes for principles of prog...
This paper presents a method to translate a proof in an extensional version of the Calculus of Constructions into a proof in the Calculus of Inductive Constructions extended with a few axioms. We use a specific equality in order to translate the extensional conversion relation into an intensional system.
We answer Klop and de Vrijer’s question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a “syntactic” proof that the extensional lambda calculus with surjective pairing is consistent.
We build a Kleene realizability semantics for the two-level Minimalist Foundation MF, ideated by Maietti and Sambin in 2005 and completed by Maietti in 2009. Thanks to this semantics we prove that both levels of MF are consistent with the formal Church Thesis CT. Since MF consists of two levels, an intensional one, called mTT, and an extensional one, called emTT, linked by an interpretation, it...
This paper is a contribution to the formal study and analysis of vernacular forms of program derivation. Specifically, in this paper, our vernacular derivations are elementary program transformations over the natural numbers. We provide an intensional semantics for these transformations within the derivations of the Elementary theory of Operations and Numbers, EON, [Bee85]. This semantics is in...
This paper presents a new metamodel based on partially ordered hypersets. The metamodel is minimalist, its only primitives being atoms, potentially infinite hypersets and partial order. The type system is very loose and supports concurrent extensional and intensional definition of types. Every element of the metamodel can be directly referenced, thanks to a powerful automated reification facili...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید