Results 11 to 20 of about 37,011 (230)
(In)consistency of Extensions of Higher Order Logic and Type Theory [PDF]
, 2007 It is well-known, due to the work of Girard and Coquand, that adding polymorphic domains to higher order logic, HOL, or its type theoretic variant ¿HOL, renders the logic inconsistent. This is known as Girard’s paradox, see [4]. But there is also another presentation of higher order logic, in its type theoretic variant called ¿PRED¿, to which ...
Altenkirsch, T. +4 more
openaire +4 more sources
Discussion on Redundant Processing Algorithm of Association Rules Based on Hypergraph in Data Mining
Journal of Robotics, 2022 With the rapid advancement of big data, it is becoming a great problem for people to find objective information in the database. The relevance data processing rule for digging the information can be the way. Relevance data processing rule for digging the
Jintan Zhu
doaj +1 more source
Learning Probabilities: Towards a Logic of Statistical Learning [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We propose a new model for forming beliefs and learning about unknown probabilities (such as the probability of picking a red marble from a bag with an unknown distribution of coloured marbles).
Alexandru Baltag +2 more
doaj +1 more source
Translating dependent type theory into higher order logic [PDF]
, 2006 This paper describes a translation of the complex calculus of dependent type theory into the relatively simpler higher order logic originally introduced by Church. In particular, it shows how type dependency as found in Martin-Lof's Intuitionistic Type Theory can be simulated in the formulation of higher order logic mechanized by the HOL theoremproving
Jacobs, B, Melham, T
openaire +2 more sources
CIFOL: Case-intensional first order logic. (I) Toward a theory of sorts [PDF]
, 2012 This is Part I of a two-part essay introducing case-intensional first-order logic (CIFOL), an easy-to-use, uniform, powerful, and useful combination of first order logic with modal logic resulting from philosophical and technical modifications of Bressan’
Nuel Belnap +3 more
core +1 more source
Henkin semantics for reasoning with natural language
Journal of Language Modelling, 2016 The frequency of intensional and non-first-order definable operators in natural languages constitutes a challenge for automated reasoning with the kind of logical translations that are deemed adequate by formal semanticists.
Michael Hahn, Frank Richter
doaj +1 more source
Relational parametricity for higher kinds [PDF]
, 2012 Reynolds’ notion of relational parametricity has been extremely influential and well studied for polymorphic programming languages and type theories based on System F.
Atkey, Robert
core +1 more source
First-Order Logic Foundation of Relativity Theories [PDF]
, 2006 Motivation and perspective for an exciting new research direction interconnecting logic, spacetime theory, relativity--including such revolutionary areas as black hole physics, relativistic computers, new cosmology--are presented in this paper.
X. Madarasz, Judit +5 more
core +1 more source
Amortised resource analysis with separation logic [PDF]
, 2010 Type-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete ...
Robert Atkey, Atkey, Robert
core +1 more source