Incompleteness in Linear Time
نویسندگان
چکیده
A class LT 0 of functions computable in a proper sub-class of Lintime is de ned, and formalized in a system LT0 of monadic and atomic (quanti er-free) logic. In spite of its poor computational complexity power and logical apparatus, this system has enough power to describe its own proof-predicate. Therefore it might qualify as smallest known system in which Godel-like diagonalization can be applied. A proof is given that the identically true functions of LT 0 are productive. Hence this incompleteness phenomenon doesn't depend on the technicalities adopted to show it.
منابع مشابه
پیدا کردن یک نقطه درونی نسبی یک چندوجهی با استفاده از برنامهریزی خطی: کاربرد در برنامهریزی هندسی
One of the fundamental concepts in convex analysis and optimization is the relative interior of a set. This concept is used when the interior of a set is empty due to the incompleteness of its dimension. In this paper, first, we propose a linear programming model to find a relative interior point of a polyhedral set. Then, we discuss the application of this model to geometric programming. Speci...
متن کاملIPM-Isfahan workshop on Various Aspects of Modality
Paradoxes are amazing puzzles in philosophy (and mathematics), and they can be interesting when turned into proofs and theorems (in mathematics and logic). For example, Russell's paradox, which collapsed Frege's foundations of mathematics, is now a classical theorem in set theory, and implies that no set of all sets can exist. Or, as another example, the Liar paradox has turned into Tarski's th...
متن کاملUpdating with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental problem, and of articular interest for Bayesian networks. Recently, Griinwald and Halpern have shown that commonly used updating strategies fail here, except under very special assumptions. We propose a new rule for updat...
متن کاملLinear regression analysis of censored medical costs.
This paper deals with the problem of linear regression for medical cost data when some study subjects are not followed for the full duration of interest so that their total costs are unknown. Standard survival analysis techniques are ill-suited to this type of censoring. The familiar normal equations for the least-squares estimation are modified in several ways to properly account for the incom...
متن کاملIncompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs
It is shown that the infinite-valued first-order Gödel logic G based on the set of truth values {1/k : k ∈ ω \ {0}} ∪ {0} is not r.e. The logic G is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger’s temporal logic of programs (even of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 6 شماره
صفحات -
تاریخ انتشار 2000