Results 1  10
of
187,956
1 THE INEVITABILITY OF LOGICAL STRENGTH:
, 2007
"... Abstract. An extreme kind of logic skeptic claims that "the present formal systems used for the foundations of mathematics are artificially strong, thereby causing unnecessary headaches such as the Gödel incompleteness phenomena". The skeptic continues by claiming that "lo ..."
Abstract
 Add to MetaCart
Abstract. An extreme kind of logic skeptic claims that "the present formal systems used for the foundations of mathematics are artificially strong, thereby causing unnecessary headaches such as the Gödel incompleteness phenomena". The skeptic continues by claiming that &
New results on unprovability and logical strength
, 2007
"... This is a preprint for MaxPlanck Institute’s proceedings. We present recent results in the area of unprovability. We find unprovable statements about a general class of functions using similtaneous diophantine approximation, unprovability results about the Riemann zetafunction using almostperiodi ..."
Abstract
 Add to MetaCart
This is a preprint for MaxPlanck Institute’s proceedings. We present recent results in the area of unprovability. We find unprovable statements about a general class of functions using similtaneous diophantine approximation, unprovability results about the Riemann zetafunction using almostperiodicity and probabilistic arguments and a simple unprovability result about converging series using existence of a universal series, that is a sum of terms of the form ai · x k i · y ℓ i whose rearrangement converges to an arbitrary function of two variables. This reseach takes its origin from H.Friedman’s sine principle [2]. The statement roughly says that the sinefunction, when considered discretely with rational steps, returns to smaller and smaller neighbourhoods of the same point arbitrarily often. The main idea behind the unprovability proof of the sineprinciple is that it was possible to somehow formulate Ramseytheoretic statements in this setup without actually mentioning quantification over all possible colourings. It turns out that it is possible to extend this result to larger classes of functions in place of sine, to results of separate interest. This research
On the logical strength of the automorphism groups of free nilpotent groups
 Contemp. Math
, 2002
"... ar ..."
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp
 IEEE Transactions on Software Engineering
, 1997
"... ACL2 is a reimplemented extended version of Boyer and Moore's Nqthm and Kaufmann's PcNqthm, intended for large scale verification projects. This paper deals primarily with how we scaled up Nqthm's logic to an "industrial strength" programming language  namely, a large a ..."
Abstract

Cited by 129 (6 self)
 Add to MetaCart
ACL2 is a reimplemented extended version of Boyer and Moore's Nqthm and Kaufmann's PcNqthm, intended for large scale verification projects. This paper deals primarily with how we scaled up Nqthm's logic to an "industrial strength" programming language  namely, a large
On the Strength of Ramsey's Theorem
 Notre Dame J. Formal Logic
, 1995
"... this paper we study the logical strength of Ramsey's Theorem (1930), especially of Ramsey's Theorem for partitions of pairs into two pieces. ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
this paper we study the logical strength of Ramsey's Theorem (1930), especially of Ramsey's Theorem for partitions of pairs into two pieces.
On schemes of combinatorial transcription logic.
 Proc. Natl. Acad. Sci. USA
, 2003
"... Cells receive a wide variety of cellular and environmental signals, which are often processed combinatorially to generate specific genetic responses. Here we explore theoretically the potentials and limitations of combinatorial signal integration at the level of cisregulatory transcription control. ..."
Abstract

Cited by 141 (1 self)
 Add to MetaCart
DNA interaction and weak gluelike interaction between regulatory proteins, we show explicit schemes to implement regulatory logic functions of increasing complexity by appropriately selecting the strengths and arranging the relative positions of the relevant proteinbinding DNA sequences in the cis
Knowledge compilation and theory approximation
 Journal of the ACM
, 1996
"... Computational efficiency is a central concern in the design of knowledge representation systems. In order to obtain efficient systems, it has been suggested that one should limit the form of the statements in the knowledge base or use an incomplete inference mechanism. The former approach is often t ..."
Abstract

Cited by 185 (5 self)
 Add to MetaCart
— allowing for efficient subsequent query answering. We show how propositional logical theories can be compiled into Horn theories that approximate the original information. The approximations bound the original theory from below and above in terms of logical strength. The procedures are extended to other
Strength
, 2013
"... Wilson and Daly’s Young Male Syndrome thesis seeks to explain why young men are disproportionally involved in both violence and nonviolent activities entailing a risk of injury or death. One interpretation of this thesis, which we term the Crazy Bastard Hypothesis, holds that the correlation betwee ..."
Abstract
 Add to MetaCart
. Voluntary physical risktaking may thus serve a signaling function such that riskprone individuals are perceived as more formidable than riskaverse individuals. Prior work has demonstrated that relative formidability is represented using the dimensions of conceptualized size and strength, providing
A Logic of Argumentation for Reasoning under Uncertainty.
 Computational Intelligence
, 1995
"... We present the syntax and proof theory of a logic of argumentation, LA. We also outline the development of a category theoretic semantics for LA. LA is the core of a proof theoretic model for reasoning under uncertainty. In this logic, propositions are labelled with a representation of the arguments ..."
Abstract

Cited by 145 (8 self)
 Add to MetaCart
of the arguments which support their validity. Arguments may then be aggregated to collect more information about the potential validity of the propositions of interest. We make the notion of aggregation primitive to the logic, and then define strength mappings from sets of arguments to one of a number of possible
Meeting strength in substructural logics
 Logic Group Preprint Series 38, Dept. of
, 1993
"... This paper contributes to the theory of hybrid substructural logics, i.e. weak logics given by a Gentzenstyle proof theory in which there is only a limited possibility to use structural rules. Following the literature, we use an operator to mark formulas to which the extra structural rules may be a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper contributes to the theory of hybrid substructural logics, i.e. weak logics given by a Gentzenstyle proof theory in which there is only a limited possibility to use structural rules. Following the literature, we use an operator to mark formulas to which the extra structural rules may
Results 1  10
of
187,956