A test for the equality of truth-tables

1952 ◽  
Vol 17 (3) ◽  
pp. 161-163 ◽  
Author(s):  
Jan Kalicki
Keyword(s):  
Finite Number ◽  
General Method ◽  
Truth Tables

In this paper the symbolism, definitions and results of my two papers, namely A test for the existence of tautologies according to many-valued truth-tables (hereafter referred to as ET) and Note on truth-tables (hereafter referred to as TT) will be presupposed.The problem whether two arbitrary truth-tables with finite number of elements are equal or not was reduced in TT to the question of equality of two identical tables in which different elements have been designated. However, no general method for testing the equality of truth-tables was given there, although some cases were discussed for which such a method is available. In the present paper we shall describe a general method using the considerations of ET and TT.

A test for the existence of tautologies according to many-valued truth-tables

1950 ◽  
Vol 15 (3) ◽  
pp. 182-184 ◽  
Author(s):  
Jan Kalicki
Keyword(s):  
Finite Number ◽  
Truth Table ◽  
Effective Procedure ◽  
Single Variable ◽  
Truth Values ◽  
Contraction Process ◽  
The One ◽  
Image Position ◽  
Truth Tables

Theorem. There is an effective procedure to decide whether the set of tautologies determined by a given truth-table with a finite number of elements is empty or not.Proof. Let W(P) be a w.f.f. with a single variable P and n a given n-valued truth-table with elements (values)Substitute 1, 2, 3, …, n in succession for P. By the usual contraction process let W(P) assume the truth-values w1, w2, w3, …, wn respectively. The sequencewill be called the value sequence of W(P).Value sequences consisting of designated elements of exclusively will be called designated; others will be called undesignated.All the W(P)'s will be classified in the following way:(a) to the first class CL1 of W(P)'s there belongs the one element P,(b) to the (t + 1)th class CLt + 1 belong all the w.f.f. which can be built up by means of one generating connective from constituent w.f.f. of which one is an element of CLt and all the others (if any) are elements of CLn ≤ t.For example, if N and C are the connectives described by a truth-table etc.Let ∣CLn∣ stand for the set of value sequences of the elements of CLn.

Note on truth-tables

1950 ◽  
Vol 15 (3) ◽  
pp. 174-181 ◽  
Author(s):  
Jan Kalicki
Keyword(s):  
Finite Number ◽  
Truth Table ◽  
Truth Value ◽  
Truth Tables

In this paper a method will be described which is intended to exhibit some relationships between sets of tautologies determined by truth-tables. This method is an attempt to form an algebra of truth-tables. The results sketched below are restricted to sets of tautologies determined by truth-tables with a finite number of elements and involving a single binary connective Δ. However, most of the results can be easily extended to the case of Tarski's logical matrix and even to a more general case.We denote by S() the set of all tautologies (-tautologies) according to a given truth-table . Let describe a binary connective Δ. Then Δ()(x, y) stands for the truth-value of ΔPQ, when P has the truth-value x and Q has the truth-value y. If no ambiguity may arise we write Δ(x, y) or Δ() for Δ()(x, y).

scholarly journals Note on the Summation of Finite Algebraic Series

1935 ◽  
Vol 29 ◽  
pp. xiii-xx
Author(s):  
J. A. Macdonald
Keyword(s):  
Difference Equation ◽  
Finite Number ◽  
General Expression ◽  
Simple Form ◽  
The Difference ◽  
General Method

In order that an algebraic series of a finite number of terms may be summed in simple form, there must exist a difference equation satisfied by the terms. But, owing to the fact that no general method of finding this equation is given in textbooks, the beginner does not acquire confidence in summation until his experience is wide enough to include all of the usual types of such series; and even then he may come to the conclusion that the finding of the difference equation is no more than a lucky chance. It is therefore proposed in the following notes to show that the ordinary types of summable terminating series can be reduced to one, and to find a single general expression for the sum. It will also be shown that the criterion of summability is the “convergency ratio.”

ON CONTRA-CLASSICAL VARIANTS OF NELSON LOGIC N4 AND ITS CLASSICAL EXTENSION

2018 ◽  
Vol 11 (4) ◽  
pp. 805-820 ◽  
Author(s):  
HITOSHI OMORI ◽  
HEINRICH WANSING
Keyword(s):  
Paraconsistent Logic ◽  
Axiom System ◽  
Kripke Semantics ◽  
Classical Extension ◽  
Nelson Logic ◽  
General Method ◽  
Truth Tables

AbstractIn two recent articles, Norihiro Kamide introduces unusual variants of Nelson’s paraconsistent logic and its classical extension. Kamide’s systems, IP and CP, are unusual insofar as double negations in these logics behave as intuitionistic and classical negations, respectively. In this article we present Hilbert-style axiomatizations of both IP and CP. The axiom system for IP is shown to be sound and complete with respect to a four-valued Kripke semantics, and the axiom system for CP is characterized by four-valued truth tables. Moreover, we note some properties of IP and CP, and emphasize that these logics are unusual also because they are contra-classical and inconsistent but nontrivial. We point out that Kamide’s approach exemplifies a general method for obtaining contra-classical logics, and we briefly speculate about a linguistic application of Kamide’s logics.

Criteria and Methods for Reliable Three-Dimensional Image Reconstruction

1974 ◽  
Vol 32 ◽  
pp. 330-331
Author(s):  
R. A. Crowther
Keyword(s):  
Image Reconstruction ◽  
Finite Number ◽  
Density Distribution ◽  
Electron Micrographs ◽  
Mathematical Problem ◽  
Three Dimensional ◽  
Ideal Case ◽  
Dimensional Image ◽  
General Object ◽  
The Ideal

The reconstruction of a three-dimensional image of a specimen from a set of electron micrographs reduces, under certain assumptions about the imaging process in the microscope, to the mathematical problem of reconstructing a density distribution from a set of its plane projections.In the absence of noise we can formulate a purely geometrical criterion, which, for a general object, fixes the resolution attainable from a given finite number of views in terms of the size of the object. For simplicity we take the ideal case of projections collected by a series of m equally spaced tilts about a single axis.

A General Method for Spectrometer Design in the Scoff Approximation

1976 ◽  
Vol 34 ◽  
pp. 538-539
Author(s):  
J. R. Fields
Keyword(s):  
Electron Microscope ◽  
Transmission Electron Microscope ◽  
Energy Analysis ◽  
Incident Beam ◽  
Scanning Transmission Electron Microscope ◽  
Chemical Identification ◽  
Scanning Transmission Electron ◽  
Transmission Electron ◽  
Scanning Transmission ◽  
General Method

The energy analysis of electrons scattered by a specimen in a scanning transmission electron microscope can improve contrast as well as aid in chemical identification. In so far as energy analysis is useful, one would like to be able to design a spectrometer which is tailored to his particular needs. In our own case, we require a spectrometer which will accept a parallel incident beam and which will focus the electrons in both the median and perpendicular planes. In addition, since we intend to follow the spectrometer by a detector array rather than a single energy selecting slit, we need as great a dispersion as possible. Therefore, we would like to follow our spectrometer by a magnifying lens. Consequently, the line along which electrons of varying energy are dispersed must be normal to the direction of the central ray at the spectrometer exit.

Phase behavior of cationic and anionic surfactants at low concentrations

1992 ◽  
Vol 50 (1) ◽  
pp. 694-695
Author(s):  
E. Naranjo
Keyword(s):  
Phase Behavior ◽  
Structural Characterization ◽  
Dynamic Systems ◽  
Anionic Surfactants ◽  
Intermolecular Forces ◽  
Stable Form ◽  
Surfactant Mixtures ◽  
Low Concentrations ◽  
Cationic And Anionic Surfactants ◽  
General Method

Equilibrium vesicles, those which are the stable form of aggregation and form spontaneously on mixing surfactant with water, have never been demonstrated in single component bilayers and only rarely in lipid or surfactant mixtures. Designing a simple and general method for producing spontaneous and stable vesicles depends on a better understanding of the thermodynamics of aggregation, the interplay of intermolecular forces in surfactants, and an efficient way of doing structural characterization in dynamic systems.

Caricaturing as a general method to improve poor face recognition: Evidence from low-resolution images, other-race faces, and older adults.

2019 ◽  
Vol 25 (2) ◽  
pp. 256-279 ◽  
Author(s):  
Amy Dawel ◽  
Tsz Ying Wong ◽  
Jodie McMorrow ◽  
Callin Ivanovici ◽  
Xuming He ◽  
...  
Keyword(s):  
Older Adults ◽  
Face Recognition ◽  
Low Resolution ◽  
General Method ◽  
Low Resolution Images

Morphosemantic Analysis and Translation of Medical Compound Terms

1991 ◽  
Vol 30 (01) ◽  
pp. 30-35 ◽  
Author(s):  
P. Dujols ◽  
P. Aubas ◽  
C. Baylon ◽  
F. Grémy
Keyword(s):  
Medical Terms ◽  
General Method

This paper describes an automatic procedure for morphosemantic analysis and translation of compound medical terms. This analysis is of interest for the automatic indexation of medical discharge reports and summaries. Since words with the suffix -osis may have many different semantic interpretations, such -osis forms are taken as examples for a general method that avoids the difficulties in interpreting medical terms as reported in other studies.

Sign in / Sign up

Export Citation Format

Share Document