On complete theories with a finite number of denumerable models

1973 ◽  
Vol 12 (5) ◽  
pp. 310-326 ◽  
Author(s):  
M. G. Peretyat'kin
Keyword(s):  
Finite Number ◽  
Complete Theories

A remark concerning decidability of complete theories

1950 ◽  
Vol 15 (4) ◽  
pp. 277-279 ◽  
Author(s):  
Antoni Janiczak
Keyword(s):  
Finite Number ◽  
Decision Procedure ◽  
Effective Procedure ◽  
Undecidable Theory ◽  
Consistent Extension ◽  
Complete Theories ◽  
General Conditions

A formalized theory is called complete if for each sentence expressible in this theory either the sentence itself or its negation is provable.A theory is called deciddble if there exists an effective procedure (called decision-procedure) which enables one to decide of each sentence, in a finite number of steps, whether or not it is provable in the theory.It is known that there exist complete but undecidable theories. There exist, namely, the so called essentially undecidable theories, i.e. theories which are undecidable and remain so after an arbitrary consistent extension of the set of axioms. Using the well-known method of Lindenbaum we can therefore obtain from each such theory a complete and undecidable theory.The aim of this paper is to prove a theorem which shows that complete theories satisfying certain very general conditions are always decidable. In somewhat loose formulation these conditions are: There exist four effective methods M1, M2, M3, M4, such that(a) M1 enables us to decide in each case whether or not any given formula is a sentence of the theory;(b) M2 gives an enumeration of all axioms of the theory;(c) the rules of inference can be arranged in a sequence R1, R2, … such that if p1, … pk, r are arbitrary sentences of the theory, we can decide by M3 whether or not r results from p1, … pk, by the n-th rule;(d) M4 enables us to construct effectively the negation of each effectively given sentence.In order to express these conditions more precisely we shall make use of an arithmetization of the considered theory .

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.

On the Probabilistic Nature of Observable Phenomena

2019 ◽  
Author(s):  
Muhammad Ali
Keyword(s):  
Quantum Mechanics ◽  
Complete Theory ◽  
Interpretation Of Quantum Mechanics ◽  
Multiple Realities ◽  
Lack Of Information ◽  
Complete Theories ◽  
Probabilistic Nature

This paper proposes a Gadenkan experiment named “Observer’s Dilemma”, to investigate the probabilistic nature of observable phenomena. It has been reasoned that probabilistic nature in, otherwise uniquely deterministic phenomena can be introduced due to lack of information of underlying governing laws. Through theoretical consequences of the experiment, concepts of ‘Absolute Complete’ and ‘Observably Complete” theories have been introduced. Furthermore, nature of reality being ‘absolute’ and ‘observable’ have been discussed along with the possibility of multiple realities being true for observer. In addition, certain aspects of quantum mechanics have been interpreted. It has been argued that quantum mechanics is an ‘observably complete’ theory and its nature is to give probabilistic predictions. Lastly, it has been argued that “Everettian - Many world” interpretation of quantum mechanics is very real and true in the framework of ‘observable nature of reality’, for humans.

Sensitivity of Stationary Equitable Preferences

2017 ◽  
Author(s):  
Tapan Mitra
Keyword(s):  
Finite Number ◽  
Social Preference ◽  
Social Preferences ◽  
Principal Result ◽  
Fundamental Difficulty ◽  
The Future ◽  
Utility Stream ◽  
Preference Orders ◽  
Infinite Utility Streams

The paper studies the sensitivity implications of the class of monotone social preference orders on infinite utility streams which satisfy the axioms of Equity (Finite Anonymity) and Stationarity (Independent Future). The principal result of this investigation is that representability of such preference orders implies a certain lack of sensitivity to the utility stream of any finite number of generations, which we refer to as ‘insensitivity to the present’. Our result points to a fundamental difficulty in implementing the sustainability principle, which requires intertemporal social preferences to reflect fairly the interests of the generations in the present and in the future.

The inverse problem of recovering the coefficients of a differential equations on a graph

2020 ◽  
Vol 28 (5) ◽  
pp. 727-738
Author(s):  
Victor Sadovnichii ◽  
Yaudat Talgatovich Sultanaev ◽  
Azamat Akhtyamov
Keyword(s):  
Inverse Problem ◽  
Inverse Problems ◽  
Differential Equations ◽  
Boundary Value Problem ◽  
Boundary Conditions ◽  
Finite Number ◽  
Characteristic Equation ◽  
Arbitrary Number ◽  
New Class ◽  
Finite Set

AbstractWe consider a new class of inverse problems on the recovery of the coefficients of differential equations from a finite set of eigenvalues of a boundary value problem with unseparated boundary conditions. A finite number of eigenvalues is possible only for problems in which the roots of the characteristic equation are multiple. The article describes solutions to such a problem for equations of the second, third, and fourth orders on a graph with three, four, and five edges. The inverse problem with an arbitrary number of edges is solved similarly.

scholarly journals MODELING AND PRODUCTIVITY PREDICTION OF THE COMPANIES-INTERNAL CROWDSOURCING-BASED IDEATION

2021 ◽  
Vol 1 ◽  
pp. 2147-2156
Author(s):  
Pavel Livotov
Keyword(s):  
Mathematical Model ◽  
Finite Number ◽  
Research Question ◽  
Performance Function ◽  
Non Linear ◽  
Series Of Experiments ◽  
Productivity Prediction ◽  
A Company

AbstractThe internal crowdsourcing-based ideation within a company can be defined as an involvement of its staff, specialists, managers, and other employees, to propose solution ideas for a pre-defined problem. This paper addresses a question, how many participants of the company-internal ideation process are required to nearly reach the ideation limit for the problems with a finite number of workable solutions. To answer the research question, the author proposes a set of metrics and a non-linear ideation performance function with a positive decreasing slope and ideation limit for the closed-ended problems. Three series of experiments helped to explore relationships between the metric attributes and resulted in a mathematical model which allows companies to predict the productivity metrics of their crowdsourcing ideation activities such as quantity of different ideas and ideation limit as a function of the number of contributors, their average personal creativity and ideation efficiency of a contributors’ group.

Sign in / Sign up

Export Citation Format

Share Document