Blocking the Routes to Triviality with Depth Relevance
نویسندگان
چکیده
In Rogerson and Restall’s (J Philos Log 36, 2006, p. 435), the “class of implication formulas known to trivialize (NC)” (NC abbreviates “naïve comprehension”) is recorded. The aim of this paper is to show how to invalidate any member in this class by using “weak relevant model structures”. Weak relevant model structures verify deep relevant logics only.
منابع مشابه
On Post-Modern Cryptography
This essay relates to a recent article of Koblitz&Menezes that “criticizes several typical ‘provable security’ results” and argues that the “theorem-proof paradigm of theoretical mathematics is often of limited relevance” to cryptography. Although it should be obvious that these claims are utterly wrong, we undertake articulating this triviality. In particular, we point out some of the fundamen...
متن کاملRoutes to Triviality
It is known that a number of inference principles can be used to trivialise the axioms of naı̈ve comprehension — the axioms underlying the naı̈ve theory of sets. In this paper we systematise and extend these known results, to provide a number of general classes of axioms responsible for trivialising naı̈ve comprehension.
متن کاملInvestigating the effect of structural form of outdoor path of residential complexes on improving the routing of people in emergency situations
Background and Objective: Due to the importance of time in choosing the optimal routing to reduce the damage caused by accidents in critical situations such as earthquakes, fires, etc., the structural form of the route has a significant impact on the selection of people in emergencies. It can also be very effective in the work for designers, managers and urban planners for disaster risk managem...
متن کاملA virtually nonblocking self - routing permutation network which routes packets in O ( log 2 N ) time
Asymptotically nonblocking networks are O(log2 N) depth self-routing permutation devices in which blocking probability vanishes when N (the number of network inputs) increases. This behavior does not guarantee, also for very large N , that all information always and simultaneously reaches its destination (and consequently that a whole permutation passes through the device) which is a requiremen...
متن کاملA remark on the numerical validation of triviality for scalar field theories using high-temperature expansions
We suggest a simple modification of the usual procedures of analysis for the high-temperature (strong-coupling or hopping-parameter) expansions of the renormalized four-point coupling constant in the ~ φ4 lattice scalar field theory. As a result we can more convincingly validate numerically the triviality of the continuum limit taken from the high temperature phase. There has been a steady accu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 23 شماره
صفحات -
تاریخ انتشار 2014