Search results for " Logic"
showing 10 items of 1720 documents
Lambda substitution algebras
1993
In the paper an algebraic metatheory of type-free λ-calculus is developed. Our version is based on lambda substitution algebras (λSAs), which are just SAs introduced by Feldman (for algebraizing equational logic) enriched with a countable family of unary operations of λ-abstraction and a binary operation of application. Two representation theorems, syntactical and semantic, are proved, what directly provides completeness theorems.
Fuzzy Relational Mathematical Morphology: Erosion and Dilation
2020
In the recent years, the subject if fuzzy mathematical morphology entered the field of interest of many researchers. In our recent paper [23], we have developed the basis of the (unstructured) L-fuzzy relation mathematical morphology where L is a quantale. In this paper we extend it to the structured case. We introduce structured L-fuzzy relational erosion and dilation operators, study their basic properties, show that under some conditions these operators are dual and form an adjunction pair. Basing on the topological interpretation of these operators, we introduce the category of L-fuzzy relational morphological spaces and their continuous transformations.
On Inductive Generalization in Monadic First-Order Logic With Identity
1966
Publisher Summary The chapter examines the results obtained by means of a system when the relation of identity is used in addition to monadic predicates. The chapter compares the new system of inductive logic sketched by Jaakko Hintikka with Carnap's system. The main advantage of Hintikka's system is that it gives natural degrees of confirmation to inductive generalizations, whereas Carnap's confirmation function c * enables one to deal satisfactorily with singular inductive inference only. According to Carnap's system, general sentences that are not logically true receive nonnegligible degrees of confirmation only if the evidence contains a large part of the individuals in the whole univer…
NeutroAlgebra is a Generalization of Partial Algebra
2020
In this paper we recall, improve, and extend several definitions, properties and applications of our previous 2019 research referred to NeutroAlgebras and AntiAlgebras (also called NeutroAlgebraic Structures and respectively AntiAlgebraic Structures). Let <A> be an item (concept, attribute, idea, proposition, theory, etc.). Through the process of neutrosphication, we split the nonempty space we work on into three regions {two opposite ones corresponding to <A> and <antiA>, and one corresponding to neutral (indeterminate) <neutA> (also denoted <neutroA>) between the opposites}, which may or may not be disjoint – depending on the application, but they are …
A constructive semantics for non-deducibility
2008
This paper provides a constructive topological semantics for non-deducibility of a first order intuitionistic formula. Formal topology theory, in particular the recently introduced notion of a binary positivity predicate, and co-induction are two needful tools. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
On P-compatible hybrid identities and hyperidentities
1994
P-compatible identities are built up from terms with a special structure. We investigate a variety defined by a set ofP-compatible hybrid identities and answer the question whether a variety defined by a set ofP-compatible hyperidentities can be solid.
A note on multiple summing operators and applications
2018
We prove a new result on multiple summing operators and, among other results and applications, we provide a new extension of Littlewood’s 4 / 3 inequality to m-linear forms.
Product of extension domains is still an extension domain
2018
We prove the product of the Sobolev-extension domains is still a Sobolev-extension domain.
Polish G-spaces and continuous logic
2017
Abstract We extend the generalised model theory of H. Becker from [2] to the case of Polish G -spaces when G is an arbitrary Polish group. Our approach is inspired by logic actions of Polish groups which arise in continuous logic.