Bi- Logic Via Infinite Singletons
نویسنده
چکیده
Bi-logic [1] describes two sides of the human thinking, the rational reasoning (asymmetric mode) and the symmetric mode, also termed indivisible mode, where any relation is symmetric and any set is infinite. In a quantum model [2], we have characterized the class of finite sets for which the membership relation can be expressed as a finite propositional disjunction of equalities, in the object language. Finiteness can be recognized, at the object level, only when this happens. In particular, one can conceive an infinite singleton, dropping, in the object language, the closed term which denotes its unique element. Infinite singletons satisfy the symmetry property as well, since the class of sets where any relation is symmetric is exactly the class of singletons. The logic of infinite singletons represents a symmetric kernel, in sequent calculus [3]. It has the features of the symmetric mode: absence of mutual contradiction and condensation, absence of negation, absence of time, and displacement. The direction of logical consequence becomes irrelevant. In this setting, one can develop the definition of a generalized quantifier, disappearing once consequence is recovered, that represents correlations. Considering the structural rules of sequent calculus, this suggests a possible approach to the problem of the representation of contextual reasoning and other kinds of human reasoning in artificial intelligence [4].
منابع مشابه
A Predicative Characterization of Quantum States and Matte Blanco's Bi-logic
We show a correspondence between a predicative characterization of quantum states, we have recently introduced, and bi-logic, a logical setting proposed by the Chilean psychoanalist I. Matte Blanco in order to describe the logic of the unconscious. The unconscious deals with “infinite” objects for which the “symmetric mode” is characterized, where negation and implication do not exist. In our m...
متن کاملThe Minimal Size of Infinite Maximal Antichains in Direct Products of Partial Orders
For a partial order P having infinite antichains by a(P) we denote the minimal cardinality of an infinite maximal antichain in P and investigate how does this cardinal invariant of posets behave in finite products. In particular we show that min{a(P), p(sqP)} ≤ a(P) ≤ a(P), for all n ∈ N, where p(sqP) is the minimal size of a centered family without a lower bound in the separative quotient of t...
متن کاملLow-distortion embeddings of infinite metric spaces into the real line
We present a proof of a Ramsey-type theorem for infinite metric spaces due to Matoušek. Then we show that for every K > 1 every uncountable Polish space has a perfect subset that K-bi-Lipschitz embeds into the real line. Finally we study decompositions of infinite separable metric spaces into subsets that, for some K > 1, K-bi-Lipschitz embed into the real line.
متن کاملBenchmarking Model- and Satisfiability-Checking on Bi-infinite Time
Model checking techniques traditionally deal with temporal logic languages and automata interpreted over ω-words, i.e., where time is infinite in the future but finite in the past. This is motivated by the study of reactive systems, which are typically nonterminating: system termination may be abstracted away by allowing an infinite future. In the same way, if time is infinite also in the past ...
متن کاملA syntactic proof of decidability for the logic of bunched implication BI
The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is obtained by freely combining propositional intuitionistic logic and multiplicative intuitionistic linear logic. It possesses an elegant proof theory: its bunched ca...
متن کامل