نتایج جستجو برای: Godel Logic

تعداد نتایج: 151365  

1993
Patricia M. Hill

The paper is concerned with the design of a module system for logic programming so as to satisfy many of the requirements of software en­ gineering. The design is based on the language Godel which is a logic programming language which already has a simple type and module system. The module system described here ex­ tends the Godel module system so as to include parameterised modules. In particu...

2017

In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Godel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of nonmodal and modal formulas, the latter m...

Journal: :Journal of Logic and Computation 2012

2011
Ori Lahav Arnon Avron

We define the notion of a canonical Gödel system in the framework of single-conclusion hypersequent calculi. A corresponding general (nondeterministic) Gödel valuation semantics is developed, as well as a (non-deterministic) linear intuitionistic Kripke-frames semantics. We show that every canonical Gödel system induces a class of Gödel valuations (and of Kripke frames) for which it is strongly...

2015
Alberto Momigliano

Uniform proofs systems have recently been proposed [Mil91] as a proof-theoretic foundation and generalization of logic programming. In [Mom92a] an extension with constructive negation is presented preserving the nature of abstract logic programming language. Here we adapt this approach to provide a complete theorem proving technique for minimal, intuitionistic and classical logic, which is tota...

2005
Alberto Momigliano

Uniform proofs systems have recently been proposed [Mil91] as a proof-theoretic foundation and generalization of logic programming. In [Mom92a] an extension with constructive negation is presented preserving the nature of abstract logic programming language. Here we adapt this approach to provide a complete theorem proving technique for minimal, intuitionistic and classical logic, which is tota...

2008
Xavier Caicedo Ricardo Oscar Rodríguez

Sometimes it is needed in approximate reasoning to deal simultaneously with both fuzziness of propositions and modalities, for instance one may try to assign a degree of truth to propositions like “John is possibly tall”or “John is necessarily tall”, where “John is tall”is presented as a fuzzy proposition. Fuzzy logic should be a suitable tool to model not only vagueness but also other kinds of...

Journal: :Reports on Mathematical Logic 2007
Katarzyna Slomczynska

. 1 Preliminaries Consider the variety Eω generated by the algebra ω := (N, ·), where i · j := max (i, j) for i 6= j, and i · j := 1 for i = j, i, j ∈ N1. These variety is a subvariety of the variety of equivalential algebras E . By an equivalential algebra we mean a grupoid A = (A,↔) that is a subreduct of a Brouwerian semilattice (or, equivalently, a Heyting algebra) with the operation ↔ give...

2011
W. H. Sulis

This article discusses a variety of mathematically-inspired approaches to the study of complexity and their application to the study and understanding of complex systems. These approaches have their origin in the study of limitative results in logic, mathematical linguistics, and the theory of computation, based upon the work of Godel, Turing, Chomsky, and Kolmogorov, among many others. The top...

Journal: :Philosophia Mathematica 2010

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید