Cuts and overspill properties in models of bounded arithmetic

نویسندگان

  • Morteza Moniri
  • S. Hosein Sajjadi
چکیده مقاله:

In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particular, we prove some overspill and underspill properties for them.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generic cuts in models of arithmetic

We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator Y . The notion of ‘indicator’ is defined in a novel way, without initially specifying what property is indicated and is used to define a topological space of cuts of the model. Various familiar properties of cuts (strength, regularity, saturation, coding pr...

متن کامل

The arithmetic of cuts in models of arithmetic

We present a number of results on the structure of initial segments models of Peano arithmetic with the arithmetic operations of addition, subtraction, multiplication, logarithm and a notion of derivative on cuts. Each of these operations is defined in two dual ways, often with quite different results, and we attempt to systemise the issues and show how various calculations may be carried out. ...

متن کامل

Automorphisms of Models of Bounded Arithmetic∗

We establish the following model theoretic characterization of the fragment I∆0+Exp+BΣ1 of Peano arithmetic in terms of fixed points of automorphisms of models of bounded arithmetic (the fragment I∆0 of Peano arithmetic with induction limited to ∆0-formulae). Theorem A. The following two conditions are equivalent for a countable model M of the language of arithmetic: (a) M satisfies I∆0 + BΣ1 +...

متن کامل

some properties of fuzzy hilbert spaces and norm of operators

in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...

15 صفحه اول

Parametrized Complexity of Length-Bounded Cuts and Multi-cuts

We show that theMinimal Length-Bounded L-But problem can be computed in linear time with respect to L and the tree-width of the input graph as parameters. In this problem the task is to find a set of edges of a graph such that after removal of this set, the shortest path between two prescribed vertices is at least L long. We derive an FPT algorithm for a more general multi-commodity length boun...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 8  شماره None

صفحات  59- 66

تاریخ انتشار 2013-05

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023