The M-valued calculus of non-contradiction

1953 ◽  
Vol 18 (3) ◽  
pp. 237-241
Author(s):  
Alan Rose
Keyword(s):  
Functional Completeness ◽  
Truth Values ◽  
Alternative Method ◽  
Truth Value ◽  
Set Up ◽  
Image Position ◽  
Infinite Set

The 2-valued calculus of non-contradiction of Dexter has been extended to 3-valued logic. The methods used were, however, too complicated to be capable of generalisation to m-valued logics. The object of the present paper is to give an alternative method of generalising Dexter's work to m-valued logics with one designated truth-value. The rule of procedure is generalised in the same way as before, but the deductive completeness of the system is proved by applying results of Rosser and Turquette. The system has an infinite set of primitive functions, written n(P1, P2, …, Pr) (r = 1,2, …). With the notation of Post, n(P1, P2, …, Pr) has the same truth-value as ~(P1 & P2 & … & Pr). Thus n(P) is Post's primitive ~P, and we can define & byWe use n2(P1, P2, …, Pr) as an abbreviation for n(n(P1, P2, …, Pr)); similarly for higher powers of n. But if we set up the 1-1 correspondence of truth-values i ↔ m−i+1, then & corresponds to ∨ and ~m−1 corresponds to ~. Hence the functional completeness of our system follows from a theorem of Post.We define the functions N(P), N(P, Q) byThus the truth-value of N(P) is undesignated if and only if the truth-value of P is designated, and the truth-value of N(P, Q) is undesignated if and only if the truth-values of P and Q are both designated.

A formalization of an ℵ0-valued propositional calculus

1953 ◽  
Vol 49 (3) ◽  
pp. 367-376
Author(s):  
Alan Rose
Keyword(s):  
Propositional Calculus ◽  
Rational Numbers ◽  
Truth Values ◽  
Truth Value ◽  
Image Position

In 1930 Łukasiewicz (3) developed an ℵ0-valued prepositional calculus with two primitives called implication and negation. The truth-values were all rational numbers satisfying 0 ≤ x ≤ 1, 1 being the designated truth-value. If the truth-values of P, Q, NP, CPQ are x, y, n(x), c(x, y) respectively, then

On one-dimensional unsteady flow at infinite Mach number

1968 ◽  
Vol 304 (1478) ◽  
pp. 255-273 ◽  
Keyword(s):  
Asymptotic Expansion ◽  
Blast Wave ◽  
Outer Part ◽  
The Body ◽  
Viscous Boundary Layer ◽  
Outer Flow ◽  
Hypersonic Speeds ◽  
Set Up ◽  
Viscous Boundary ◽  
Infinite Set

The use of the blast-wave analogy, as an aid to the interpretation of experimental data on the motion of a fluid past an obstacle at hypersonic speeds, has led to the theoretical study of its role in an asymptotic expansion of the solution to the governing equations at large distances downstream of the body. In all attempts to set up such an expansion it has proved necessary to divide the flow régime into two parts, an outer part dominated by the blast wave and an inner part consisting of streamlines which, originally, pass close by the body. The matching of these two regions is apparently only possible if a certain integral vanishes. In the present paper a numerical integration, in one particular set of circumstances, is carried out to test the validity of the asymptotic expansion proposed. Formally, an unsteady problem is tackled, for ease of computation, but the steady analogue follows immediately and is of exactly the form discussed in the earlier investigations. It is found that the main results are in line with the theory and that the integral in question is indistinguishable from zero. However, a deeper investigation of the asymptotic expansion shows that, for an expansion of the type envisaged, an infinite set of integrals must each vanish. The next integral does not appear to be zero according to our computations but this result is not believed to be conclusive. Assuming that all the integrals do vanish, then it appears that the inner layer, which although inviscid, has many of the characteristics of a viscous boundary layer, has the addi­tional, surprising property that it can exert no direct influence on the outer flow at large distances downstream of the body.

scholarly journals REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION

2017 ◽  
Vol 82 (2) ◽  
pp. 576-589 ◽  
Author(s):  
KOSTAS HATZIKIRIAKOU ◽  
STEPHEN G. SIMPSON
Keyword(s):  
Theorem Proving ◽  
Chain Condition ◽  
Reverse Mathematics ◽  
Partial Ordering ◽  
Young Diagrams ◽  
Equivalence Proof ◽  
Image Position ◽  
Countably Infinite ◽  
Infinite Set ◽  
Ascending Chain Condition

AbstractLetSbe the group of finitely supported permutations of a countably infinite set. Let$K[S]$be the group algebra ofSover a fieldKof characteristic 0. According to a theorem of Formanek and Lawrence,$K[S]$satisfies the ascending chain condition for two-sided ideals. We study the reverse mathematics of this theorem, proving its equivalence over$RC{A_0}$(or even over$RCA_0^{\rm{*}}$) to the statement that${\omega ^\omega }$is well ordered. Our equivalence proof proceeds via the statement that the Young diagrams form a well partial ordering.

ENRICHED INTERVAL BILATTICES AND PARTIAL MANY-VALUED LOGICS: AN APPROACH TO DEAL WITH GRADED TRUTH AND IMPRECISION

1994 ◽  
Vol 02 (01) ◽  
pp. 37-54 ◽  
Author(s):  
FRANCESC ESTEVA ◽  
PERE GARCIA-CALVÉS ◽  
LLUÍS GODO
Keyword(s):  
Approximate Reasoning ◽  
Truth Values ◽  
Partial Models ◽  
Truth Value ◽  
The Many ◽  
Available Information ◽  
States Of Knowledge

Within the many-valued approach for approximate reasoning, the aim of this paper is two-fold. First, to extend truth-values lattices to cope with the imprecision due to possible incompleteness of the available information. This is done by considering two bilattices of truth-value intervals corresponding to the so-called weak and strong truth orderings. Based on the use of interval bilattices, the second aim is to introduce what we call partial many-valued logics. The (partial) models of such logics may assign intervals of truth-values to formulas, and so they stand for representations of incomplete states of knowledge. Finally, the relation between partial and complete semantical entailment is studied, and it is provedtheir equivalence for a family of formulas, including the so-called free well formed formulas.

Complete Boolean ultraproducts

1987 ◽  
Vol 52 (2) ◽  
pp. 530-542
Author(s):  
R. Michael Canjar
Keyword(s):  
Boolean Algebra ◽  
Regular Cardinal ◽  
Complete Boolean Algebra ◽  
Full Structure ◽  
Truth Value ◽  
Image Position

Throughout this paper, B will always be a Boolean algebra and Γ an ultrafilter on B. We use + and Σ for the Boolean join operation and · and Π for the Boolean meet.κ is always a regular cardinal. C(κ) is the full structure of κ, the structure with universe κ and whose functions and relations consist of all unitary functions and relations on κ. κB is the collection of all B-valued names for elements of κ. We use symbols f, g, h for members of κB. Formally an element f ∈ κB is a mapping κ → B with the properties that Σα∈κf(α) = 1B and that f(α) · f(β) = 0B whenever α ≠ β. We view f(α) as the Boolean-truth value indicating the extent to which the name f is equal to α, and we will hereafter write ∥f = α∥ for f(α). For every α ∈ κ there is a canonical name fα ∈ κB which has the property that ∥fα = α∥ = 1. Hereafter we identify α and fα.If B is a κ+-complete Boolean algebra and Γ is an ultrafilter on B, then we may define the Boolean ultraproduct C(κ)B/Γ in the following manner. If ϕ(x0, x1, …, xn) is a formula of Lκ, the language for C(κ) (which has symbols for all finitary functions and relations on κ), and f0, f1, …, fn−1 are elements of κB then we define the Boolean-truth value of ϕ(f0, f1, …, fn−1) as

The cylindric algebras of three-valued logic

1998 ◽  
Vol 63 (4) ◽  
pp. 1201-1217
Author(s):  
Norman Feldman
Keyword(s):  
Effective Procedure ◽  
Cylindric Algebras ◽  
Truth Values ◽  
Recursive Functions ◽  
Partial Recursive Functions ◽  
Truth Value ◽  
The One ◽  
Definition Of

In this paper we consider the three-valued logic used by Kleene [6] in the theory of partial recursive functions. This logic has three truth values: true (T), false (F), and undefined (U). One interpretation of U is as follows: Suppose we have two partially recursive predicates P(x) and Q(x) and we want to know the truth value of P(x) ∧ Q(x) for a particular x0. If x0 is in the domain of definition of both P and Q, then P(x0) ∧ Q(x0) is true if both P(x0) and Q(x0) are true, and false otherwise. But what if x0 is not in the domain of definition of P, but is in the domain of definition of Q? There are several choices, but the one chosen by Kleene is that if Q(X0) is false, then P(x0) ∧ Q(x0) is also false and if Q(X0) is true, then P(x0) ∧ Q(X0) is undefined.What arises is the question about knowledge of whether or not x0 is in the domain of definition of P. Is there an effective procedure to determine this? If not, then we can interpret U as being unknown. If there is an effective procedure, then our decision for the truth value for P(x) ∧ Q(x) is based on the knowledge that is not in the domain of definition of P. In this case, U can be interpreted as undefined. In either case, we base our truth value of P(x) ∧ Q(x) on the truth value of Q(X0).

A generalization of McDiarmid's theorem for mixed Bernoulli percolation

1980 ◽  
Vol 88 (1) ◽  
pp. 167-170 ◽  
Author(s):  
J. M. Hammersley
Keyword(s):  
Random Variables ◽  
Random Variable ◽  
Finite Sequence ◽  
Random Set ◽  
Percolation Probability ◽  
Open Path ◽  
Finite Set ◽  
Image Position ◽  
Infinite Set ◽  
Mutually Independent

Let G be an infinite partially directed graph of finite outgoing degree. Thus G consists of an infinite set of vertices, together with a set of edges between certain prescribed pairs of vertices. Each edge may be directed or undirected, and the number of edges from (but not necessarily to) any given vertex is always finite (though possibly unbounded). A path on G from a vertex V1 to a vertex Vn (if such a path exists) is a finite sequence of alternate edges and vertices of the form E12, V2, E23, V3, …, En − 1, n, Vn such that Ei, i + 1 is an edge connecting Vi and Vi + 1 (and in the direction from Vi to Vi + 1 if that edge happens to be directed). In mixed Bernoulli percolation, each vertex Vi carries a random variable di, and each edge Eij carries a random variable dij. All these random variables di and dij are mutually independent, and take only the values 0 or 1; the di take the value 1 with probability p, while the dij take the value 1 with probability p. A path is said to be open if and only if all the random variables carried by all its edges and all its vertices assume the value 1. Let S be a given finite set of vertices, called the source set; and let T be the set of all vertices such that there exists at least one open path from some vertex of S to each vertex of T. (We imagine that fluid, supplied to all the source vertices, can flow along any open path; and thus T is the random set of vertices eventually wetted by the fluid). The percolation probabilityis defined to be the probability that T is an infinite set.

Contextualism, minimalism, and situationalism

2007 ◽  
Vol 15 (1) ◽  
pp. 115-137 ◽  
Author(s):  
Eros Corazza
Keyword(s):  
Semantic Content ◽  
Truth Values ◽  
Context Dependent ◽  
Truth Value ◽  
True False

After discussing some difficulties that contextualism and minimalism face, this paper presents a new account of the linguistic exploitation of context, situationalism. Unlike the former accounts, situationalism captures the idea that the main intuitions underlying the debate concern not the identity of propositions expressed but rather how truth-values are situation-dependent. The truth-value of an utterance depends on the situation in which the proposition expressed is evaluated. Hence, like in minimalism, the proposition expressed can be truth-evaluable without being enriched or expanded. Along with contextualism, it is argued that an utterance’s truth-value is context dependent. But, unlike contextualism and minimalism, situationalism embraces a form of relativism in so far as it maintains that semantic content must be evaluated vis-à-vis a given situation and, therefore, that a proposition cannot be said to be true/false eternally.

A Geometrical treatment of the Correspondence between Lines in Threefold Space and Points of a Quadric in Fivefold space

1925 ◽  
Vol 22 (5) ◽  
pp. 694-699 ◽  
Author(s):  
H. W. Turnbull
Keyword(s):  
Dimensional Space ◽  
Three Dimensional ◽  
Quadratic Relation ◽  
Four Dimensions ◽  
Homogeneous Coordinates ◽  
Plücker Coordinates ◽  
Straight Line ◽  
Set Up ◽  
Image Position ◽  
Three Dimensional Space

§ 1. The six Plücker coordinates of a straight line in three dimensional space satisfy an identical quadratic relationwhich immediately shows that a one-one correspondence may be set up between lines in three dimensional space, λ, and points on a quadric manifold of four dimensions in five dimensional space, S5. For these six numbers pij may be considered to be six homogeneous coordinates of such a point.

On Outer-Commutator Words

1974 ◽  
Vol 26 (3) ◽  
pp. 608-620 ◽  
Author(s):  
Jeremy Wilson
Keyword(s):  
Arbitrary Group ◽  
Verbal Subgroup ◽  
Reduced Word ◽  
Image Position ◽  
Countably Infinite ◽  
Outer Commutator ◽  
Infinite Set

Let F be the group freely generated by the countably infinite set X = {x1, x2, . . . ,xi, . . . }. Let w(x1, x2, . . . , xn) be a reduced word representing an element of F and let G be an arbitrary group. Then V(w, G) will denote the setwhose elements will be called values of w in G. The subgroup of G generated by V(w, G) will be called the verbal subgroup of G with respect to w and be denoted by w(G).

Sign in / Sign up

Export Citation Format

Share Document