Knowledge is not merely the characteristic of certain pieces of information being deemed true, believed and justifiable, but rather a process. The sentences that reaches the status of knowledge forms a universe that provides an interpretation of the reality one aims to describe. Language exchanges information through communication and the justification, if concludes successfully with respect to a sentence, it elevates the information to the status of knowledge. We provide a model where we define the fundamental elements of communication and grammar. As a result, knowledge must be \open\ (everyone must be able to acquire it), \free\ (everyone must be able to justifiy) and \tidy\ (everyone must be able to retrace the justification process in all its parts recursively). Ultimately, the development of knowledge processing, referred to as \emph{knowmatic}, represents the evolution of the information technologies (\it).

Imbalanced classes can cause machine learning models to classify positive class instances poorly, and the models require hyperparameter sets to optimal values. This study aims to develop random forest (RF) and support vector machine (SVM) models that use the optimal hyperparameters obtained through 5-fold cross-validation data. Both models were trained using optimal hyperparameter pairs that fit two data scenarios, the original and oversampling training sets, to produce the benchmark and best models. The model's performance was evaluated using six metrics, including training and testing data. The acquired optimal RF hyperparameter pair was (500, 10) for the minimum number of instances and tree depth level. In contrast, the acquired optimal SVM hyperparameter pair was (0.001, 500) for the gamma and constant values. The benchmark model performed approximately 98% on Accuracy, Precision, Recall, and F1 score metrics but failed to deliver any performance on Mathew's Correlation Coefficient (MC) and Area under Curve (AUC) metrics. The best RF and SVM perform less than both benchmark models in four famous metrics. Both best models have performance improvements of approximately 6% and 11% for the MCC and AUC metrics, respectively. The best RF performance was slightly better than the best SVM performance.

This article describes an approach for optimising sensor-controlled systems through minimal intervention, utilising Fuzzy Linear Systems of Equations (FLSE). Staring with a generalised model of the system behaviour, incorporating an array of control units, environmental sensors, and an expert knowledge base. The described problems of detecting the level of intervention needed to change the system state to another is handled with the help of developed methods for solving the inverse problem for FLSE. By achieving minimal intervention, we ensure that system adjustments effective, economically optimal and non-intrusive. A MATLAB-based implementation is presented.

This paper considers a specific fragment of Linear Temporal Logic for Finite traces, DECLAREd, which, to the best of our knowledge, we prove for the first time to be a {polytime} fragment of LTLf. We derive this in terms of the following ancillary results: we propose a set of novel LTLf equivalence rules that, when applied to \LTLf specifications, lead to an equivalent specification which can be computed faster by any existing verified temporal artificial intelligence task. We also introduce the concept of temporal non-simultaneity, prescribing that two activities shall never satisfy the same atom, and temporal short-circuit, that occurs when a specification interpreted in LTL would accept an infinitely long trace while, on LTLf, it can be rewritten so to postulate the absence of certain activity labels. We test these considerations over formal synthesis (Lydia), SAT-Solvers (AALTAF) and formal verification (KnoBAB) tools, where formal verification can be also run on top of a relational database and can be therefore expressed in terms of relational query answering. We show that all these benefit from the aforementioned assumptions, as running their tasks over a rewritten equivalent specification will improve their running times.

We assume that the current mathematical knowledge K is a finite set of statements from both formal and constructive mathematics, which is time-dependent and publicly available. Any theorem of any mathematician from past or present belongs to K. The set K exists only theoretically. Ignoring K and its subsets, sets exist formally in ZFC theory although their properties can be time-dependent (when they depend on K) or informal. In every branch of mathematics, the set of all knowable truths is the set of all theorems. This set exists independently of K. Algorithms always terminate. We explain the distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known. By using this distinction, we obtain non-trivial statements on decidable sets X⊆N that belong to constructive and informal mathematics and refer to the current mathematical knowledge on X. This and the next sentence justify the article title. For any empirical science, we can identify the current knowledge with that science because truths from the empirical sciences are not necessary truths but working models of truth about particular real phenomena.

The classical propositional calculus (zero-order logic, classical propositional logic), is the most fundamental two-valued logical system. In this paper we present a proof of inconsistency of the classical propositional calculus. Then, we get right away the conclusion that the metatheory of the classical propositional calculus is inconsistent.

The implementation of Boolean functions using Nano crossbar- based switching lattices has been suggested as a substitute for conventional CMOS-based approaches in digital circuits . This alternative may satisfy the needs of future electronic designs, con- sidering the expected end of Moore’s law. This study introduces CVM, a Crossbar-based circuit Verification through Modeling tech- nique

Our natural language approach concerns syntactic analysis using a dedicated Javascript library - wink-nlp - and semantic analysis based on Prolog programming language, facilitated by another Javascript library - tau-prolog - that allows defining logical programs, declaring rules and checking for goals inside Javascript language. Firstly, our program splits the original text into sentences, than into tokens and identifies each part of the sentence, dynamically maps entities into Prolog rules, then check the spelling accordingly to the Definite Clause Grammar (DCG) by querying the pre-defined program for initial goals (the sentence itself). Basically, we let the parser infer its own rules from the syntactic point of view, then check the grammar from a semantic perspective against the DCG inside the same work flow or pipeline of steps.The provided article combine the usage of wink-nlp and tau-prolog packages for natural language processing (NLP) and understanding (NLU), demonstrates the need of a supplementary logic layer based on beta reductions and provide a method to convert lambda abstractions into arrow Javascript functions.

Investment management is a common process and practice used for achieving a desirable investment goal or outcome. Investment assessment should be carried out at various stages of project realization in accordance with capital investment volume. Investment risk management implies the effective control of all procedures and monitoring of risks in all phases of the investment project. Because of the reason that a single indicator in probability calculation of achieving optimal return from the investment does not exist, performing sufficiently reliable estimates of the quality of investments becomes a tedious task. There are many indicators, factors, and criteria required for consideration to reach the effective solution of the investment problem. Unfortunately, the systematic variation of economic situations in the marketplace stipulates the continuous and frequent changes of investment conditions and environment in which the investor should act and operate. Hence, the rules required for providing a reasonable quality of investment projects can be based only on investor’s management strategy and rely on investor’s intuition and practice. The importance of classification in investment management and decision making process is undeniable. The objects to be classified are described using assessments in accordance with various criteria which can be both quantitative and qualitative. With a competent formulation of the investment process, both methods are used in parallel. There exist various decision making approaches for the investment management, and simple additive weighting (SAW) is one of the well-known multi-criteria decision making (MCDM) methods aiming to provide an optimal decision for decision maker when solving various real-life problems, and particularly, investment problem. In this paper, fuzzy simple additive weighting (FSAW) method in group decision making is applied to undertake the capital investment expenditure for purchasing cars with the purpose of renting them to the public. The development of existing FSAW method is accomplished and this process involves the sensibility of outcomes to changes in the rate of fuzziness represented with decisions taken. Eventually, the degree of fuzziness involved in an analysis that directly attempts to model the immanent vagueness and imperfectness in particular precedency judgments made, is determined. A numerical example illustrates the importance and effectiveness of the suggested approach with the aim of ranking alternatives and hence, determining the most preferred alternative in MCDM problem.

We revise the definition of graph operations in [WDK2018] and adapt correspondingly the construction of graph term algebras. As a first contribution to a prospective research field Universal Graph Algebra, we generalize some basic concepts and results from algebras to graph algebras. To tackle this generalization task, we revise and reformulate traditional set-theoretic definitions, constructions and proofs in Universal Algebra by means of more category-theoretic concepts and constructions. Especially, we generalize the concept generated subalgebra and prove that all monomorphic homomorphisms between graph algebras are regular. Derived graph operations are the other main topic. After an in depth analysis of terms as representations of derived operations in traditional algebras, we identify three basic mechanisms to construct new graph operations out of given ones: parallel composition, instantiation, and sequential composition. As a counterpart of terms, we introduce graph operation expressions with a structure as close as possible to the structure of terms. We show that the three mechanisms allow us to construct for any graph operation expression a corresponding derived graph operation in any graph algebra.

We find at least 4 quantum properties that are indeed universal in some number systems; and we can use them for quantum consciousness. Using the sets B={0,1}, N, Z, or Q has the +4 quantum properties that one can trust, as archetypes of easy communication to friends and foes, to ignoranti or cognoscenti, and for quantum computing. This paper proposes the use of Bayesian geometry to reduce the space of possible results, reducing or increasing initial beliefs by successive experimentation. This is exemplified in biology and mathematics, and can be applied to physics and other sciences. The conclusion is that an experimental fact can be absolutely verified. Any mathematical choice (as verified by computers) militating against R=Q, is under an absolutely low chance to succeed. Infinitesimals are denied based on 3^16 independent factors. This is not a probabilistic result, but based on reduction of the Bayes geometry for updating beliefs. This work applies to non-probabilistic and unknown phenomena, such as those found in oscillations (neutrino, health), evolution, and quantum computing, denies Gödel's uncertainty, and solves the liar's paradox by reflection. This connects different scientific fields with one another, in an internet, i.e., in a network of connections of multiple open networks, using the set Q, resembling a hologram, and includes entanglement.

In this paper, we develop a tractable mathematical model and emulation framework for communicating information through water using acoustic signals. Water is considered as one of the most complex mediums to model owing to its vastness and variety in characteristics depending on the scenario, what kind of water-body (lakes, rivers, tanks, sea etc.) and geographical location of the water-body is considered. Our proposed mathematical model involves the concept of damped harmonic oscillators to represent the medium (water) and Milne’s oscillator technique to map the interaction between the acoustic signal and water. Wave equations formulated for acoustic pressure and acoustic wave velocity are used to characterize the travelling acoustic signal. Signal strength, phase shift and time-delay generated from the mathematical model are fed to a Simulink-based emulator framework to generate channel samples and channel impulse responses. The emulator uses wide sense stationary uncorrelated scattering (WSSUS) assumption and finite sum-of-sinusoids (SOS) with uniformly distributed phase to generate the channel samples. Using the emulator platform it is possible to generate amplitude variation profile, Doppler shift and spread experienced by any travelling signal through different underwater communication scenarios. Such an emulator platform can be used to simulate different communication scenarios, underwater network topologies, data to train different learning models and predict performance of different modulation, multiplexing, error correction and multi-access techniques for underwater acoustic communications (UWAC) systems.

Mobile Mapping System (MMS) plays a crucial role in generating high-precision 3D maps for various applications. However, the traditional MMS that uses tilted LiDAR (light detection and ranging) has limitations in capturing complete information of the environment. To overcome these limitations, we propose a panoramic vision-aided Cartographer simultaneous localization and mapping (SLAM) system for MMS, named "PVL-Cartographer". The proposed system integrates multiple sensors to achieve accurate and robust localization and mapping. It contains two sub-systems, early fusion and middle fusion. In the early fusion, range-maps are created from LiDAR points in a panoramic image space, facilitating the incorporation of visual features. The SLAM system works with both visual features with and without augmented ranges. In the middle fusion, a pose graph combines camera and LiDAR nodes, with IMU (Inertial Measurement Unit) data providing constraints between each node. Extensive experiments in challenging outdoor scenarios demonstrate the effectiveness of the proposed SLAM system in producing accurate results, even in conditions with limited features. Overall, our proposed PVL Cartographer system offers a robust and accurate solution for MMS localization and mapping.

The proliferation of devices for the Internet of Things (IoT) and their implication in many activities of our lives have led to a considerable increase in concern about the security of these devices, posing a double challenge for designers and developers of products. On the one hand, the design of new security primitives, suitable for resource-limited devices, that can facilitate the inclusion of mechanisms and protocols to ensure the integrity and privacy of the data exchanged over the Internet. On the other hand, the development of techniques and tools to evaluate the quality of the proposed solutions as a step prior to their deployment, as well as to monitor their behavior once in operation against possible changes in operating conditions arising naturally or as a consequence of a stress situation forced by an attacker. To address these challenges, this paper first describes the design of a security primitive that plays an important role as a component of a hardware-based root of trust, as it can act as a source of entropy for true random number generation (TRNG) or as a physical unclonable function (PUF) to facilitate the generation of identifiers linked to the device on which it is implemented. The work also illustrates different software components that allow carrying out a self-assessment strategy to characterize and validate the performance of this primitive in its dual functionality, as well as to monitor possible changes in security levels that may occur during operation as a result of device aging and variations in power supply or operating temperature. The designed PUF/TRNG is provided as a configurable IP module, which takes advantage of the internal architecture of the Xilinx Series-7 and Zynq-7000 programmable devices and incorporates an AXI4-based standard interface to facilitate its interaction with soft- and hard-core processing systems. Several test systems that contain different instances of the IP have been implemented and subjected to an exhaustive set of on-line tests to obtain the metrics that determine its quality in terms of uniqueness, reliability, and entropy characteristics. The results obtained prove that the proposed module is a suitable candidate for various security applications. As an example, an implementation that uses less than 5% of the resources of a low-cost programmable device is capable of obfuscating and recovering 512-bit cryptographic keys with virtually zero error rate.

We make use of generalized iterations of the Sacks forcing to define cardinal-preserving generic extensions of the constructible universe L in which the axioms of ZF hold and in addition either 1) the parameter-free countable axiom of choice AC* fails, or 2) AC* holds but the full countable axiom of choice AC fails in the domain of reals. In another generic extension of L, we define a set X⊆P(ω), which is a model of the parameter-free part PA2* of the 2nd order Peano arithmetic PA2, in which CA(Σ21) (Comprehension for Σ21 formulas with parameters) holds, yet an instance of Comprehension CA for a more complex formula fails. Treating the iterated Sacks forcing as a class forcing over $L_{\omega_1}$, we infer the following consistency results as corollaries. If the 2nd order Peano arithmetic PA2 is formally consistent then so are the theories: 1) PA2 + negation of AC*, 2) PA2 + AC* + negation of AC, 3) PA2* + CA(Σ21) + negation of CA.

Counting in terms of cycles allows modeling many processes of Nature. We make use of a slight numerical incongruence within the numbering system to find a translational mechanism which connects sequential ↔ commutative properties of assemblies. The algorithms allow picturing the logical syntax Nature uses when reading the DNA. Ordering a collection on two different properties of its members will impose two differing sequences on the members. The coordinates of a point on a plane of which the axes are the two sorting orders sidestep the logical contradiction arising from the different linear assignments. During a reorder, elements aggregate into cycles. Using an etalon collection of simple logical symbols (which are pairs of natural numbers), which we reorder, we see typical movement patterns along the path of the string of elements that are members of the same cycle. We split the {value, position} descriptions of a natural number and observe the places the unit occupies at specific instances of time among its peers, while being a member of a cycle, under different orders prevailing. Which places elements occupy among their peers, under specific order conditions, is determined by numeric properties of the natural numbers that make up the element. The model presented is therefore tautologic, and can be compared to a hybrid of sudokus with the ultimate form of Rubik‘s cube. It is necessary for the reader to do some self-education on the matter of cycles as a prerequisite to understanding the working principle of the model. The contraption being a new development, it can’t have references in literature.One cannot lose a bet on the idea that sorting and ordering a collection of elementary logical elements will turn up typical patterns and that these archetypes of patterns will be of interest to Theoretical Physics, Chemistry, Biology, Information Theory, and some other fields, too.

Abstract—In this paper, decidability of the structures of real, rational, integer and natural numbers will be studied in different languages. Decidability or undecidability of mathematical structures is one of the fundamental and sometimes very difficult problems of mathematical logic, where several examples of problems in this field are still open and unresolved even after decades. One of the goals of Mathematical Logic is the axiomatization of mathematical theoriesTarski has proved the decidability of the theory of real and complex numbers in the language of addition and multiplication, and it is proved that theories of natural, integer, and rational numbers, in the language of addition and multiplication, are undecidable (Theorems of Gödel and Robinson). We will review The following problemes: The Main Problem 1: ⟨Q; ⊑⟩ is decidable? Problem 2: an explicit axiomatization for ⟨Z; \times⟩? and we will study boolean algebras. Boolean algebras are famous mathematical structures.Tarski showed the decidability of the elementary theory of Boolean algebras.In this paper, we study the different kinds of Boolean algebras and their properties. And we present for the first-order theory of atomic Boolean algebras a quantifier elimination algorithm. The subset relation is a partial order and indeed a lattice order,And I will prove that the theory of atomic Boolean lattice orders is decidable, and furthermore admits elimination of quantifiers. So the theory of the subset relation is decidable. And we will study decidability of atomlss boolean algebra.

A construction for the systems of natural and real numbers is presented in Zermelo-Fraenkel Set Thoery, that allows for simple proofs of the properties of these systems, and practical and mathematical applications. A practical application is discussed, in the form of a Simple and Linear Fast Adder (Patent Pending). Applications to finite group theory and analysis are also presented. A method is illustrated for finding the automorphisms of any finite group $G$, which consists of defining a canonical block form for finite groups. Examples are given, to illustrate the procedure for finding all groups of $n$ elements along with their automorphisms. The canonical block form of the symmetry group $\Delta_4$ is provided along with its automorphisms. The construction of natural numbers is naturally generalized to provide a simple and sound construction of the continuum with order and addition properties, and where a real number is an infinite set of natural numbers. A basic outline of analysis is proposed with a fast derivative algorithm. Under this representation, a countable sequence of real numbers is represented by a single real number. Furthermore, an infinite $\infty\times\infty$ real-valued matrix is represented with a single real number. A real function is represented by a set of real numbers, and a countable sequence of real functions is also represented by a set of real numbers. In general, mathematical objects can be represented using the smallest possible data type and these representations are calculable. In the last section, mathematical objects of all types are well assigned to tree structures in a proposed type hierarchy.

A description is provided of a method -- the Set Equality Method (SEM) -- to determine the validity, or lack of validity, of each categorical syllogism. A justification is given for the presentation of a new method to solve a problem which has already been solved using different approaches. First, the SEM assigns an equality of certain sets (or two of those equalities in specific cases as will be indicated) to each of the categorical propositions composing each syllogism considered -- that is, to each of the two premises and to the conclusion. Each syllogism considered is valid if and only if a) it is possible to select one of those equalities corresponding to one of the premises such that one of its members is a certain set and the other of those equalities corresponding to the other premise such that one of its members is a subset of the set mentioned, and b) it is possible to deduce an equality corresponding to the conclusion of the two equalities corresponding to the premises. In some cases, as will be specified, it is possible to provide a second test for the validity of a syllogism whose validity was already proven, thus providing information about the logical form of categorical syllogisms.

Lewis Carroll, both logician and writer, suggested a logical paradox containing furthermore two connotations (connotations or metaphors are inherent in literature rather than in mathematics or logics). The paradox itself refers to implication demonstrating that an intermediate implication can be always inserted in an implication therefore postponing its ultimate conclusion for the next step and those insertions can be iteratively and indefinitely added ad lib, as if ad infinitum. Both connotations clear up links due to the shared formal structure with other well-known mathematical observations: (1) the paradox of Achilles and the Turtle; (2) the transitivity of the relation of equality. Analogically to (1), one can juxtapose the paradox of the Liar (for Lewis Carroll’s paradox) and that of the arrow (for “Achilles and the Turtle”), i.e. a logical paradox, on the one hand, and an aporia of motion, on the other hand, suggesting a shared formal structure of both, which can be called “ontological”, on which basis “motion” studied by physics and “conclusion” studied by logic can be unified being able to bridge logic and physics philosophically in a Hegelian manner: even more, the bridge can be continued to mathematics in virtue of (2), which forces the equality (for its property of transitivity) of any two quantities to be postponed analogically ad lib and ad infinitum. The paper shows that Hilbert arithmetic underlies naturally Lewis Carroll’s paradox admitting at least three interpretations linked to each other by it: mathematical, physical and logical. Thus, it can be considered as both generalization and solution of his paradox therefore naturally unifying the completeness of quantum mechanics (i.e. the absence of hidden variables) and eventual completeness of mathematics as the same and isomorphic to the completeness of propositional logic in relation to set theory as a first-order logic (in the sense of Gödel (1930)’s completeness theorems).

We study and describe possibilities for arities of elementary theories and of their expansions. Links for arities with respect to Boolean algebras, to disjoint unions and to compositions of structures are shown. Arities and aritizabilities are semantically characterized. The dynamics for arities of theories is described.

The report details out programming approach for automating warehouse using Answer Set Programming.

This paper explores multiple perspectives and proofs regarding the validity of what is considered to be one of the – if not THE - most controversial proofs in the field of mathematics, historical and contemporary applications alike. We consider the various explanations and equivalents of the axiom along with the more widely receptive alternatives. Furthermore, we review the resistance the axiom has encountered in various fields and its potential use in the research and expansion of said fields.

In the last years, we have witnessed a remarkable progress of algorithms solving Boolean satisfiability (SAT). The success of these algorithms has been especially relevant in a large number of industrial or real-world applications, for which these SAT solvers are nowadays an essential core part of their solving processes. Interestingly enough, these applications include a very diverse and heterogeneous range of domains, such as hardware verification, planning, and cryptography, among others. Unfortunately, the reasons of the good performance of these solvers on this variety of industrial benchmarks are not completely understood yet. Since SAT solvers’ efficiency is fundamental in various domains, obtaining a better understanding of these algorithms and the reasons of their good performance is crucial. In order to shed light on this question, SAT solvers are often viewed as complex systems with many interconnected components (e.g., conflict analysis and learning mechanism, database management, search restarts) interacting in many unpredictable ways. There is the common belief that the resulting emergent behavior of these complex systems takes advantage of a certain underlying structure of the SAT formula, which is shared by the majority of these industrial problems regardless the domain they come from. Recently, there have been some attempts of characterizing this structure under the lens of complex networks, with the purpose of better understanding the success of the solvers, and potentially improving them. In this paper, we analyze the structure of industrial SAT instances under the lens of self-similarity, and study how the execution of SAT solvers affect that structure. Many real-world graphs exhibit self-similar structure (with small fractal dimension), which means that after rescaling (replacing groups of nodes by a single node), the same kind of structure can be observed. In our analysis, in which we represent SAT instances as graphs, we observe that many industrial SAT formulas exhibit the same kind of structure. Moreover, we analyze how this structure evolves by effects of learning new clauses during the search. In particular, we observe that learned clauses usually contain variables that are close in the graph representation of the formula. This is, the learning mechanism tends to work locally. On the contrary, this learning mechanism on random SAT formulas –which do not exhibit any structure at all– is unable to generate these local clauses. This difference contributes to explain the success of modern SAT solvers on industrial problems.

Successive-addition-of-digits-of-a-number(SADN) refers to the process of adding up the digits of an integer number until a single digit is obtained. Concept of SADN has been occasionally identified but seldom employed in extensive mathematical applications. This paper discusses SADN and its properties in terms of addition, subtraction and multiplication. Further, the paper applies the multiplication-property of SADN to understand the distribution of prime numbers. For this purpose the paper introduces three series of numbers -S1, S3 and S5 series- into which all odd numbers can be placed, depending on their SADN and the rationale of such classification. Extending the analysis the paper explains how composite numbers of the S1 and S5 series can be derived. Based on this discussion it concludes that even as the concept of SADN is rather simple in its formulation and appears as an obvious truism but a profound analysis of the properties of SADN in terms of fundamental mathematical functions reveals that SADN holds a noteworthy position in number theory and may have significant implications for unfolding complex mathematical questions like understanding the distribution of prime numbers and Goldbach-problem.

Let  β= (((24!)!)!)!, and let {${\mathcal P}_{n^2+1}$} denote the set of all primes of the form {$n^2+1$}. Let ${\mathcal M}$ denote the set of all positive multiples of elements of the set {${\mathcal P}_{n^2+1} \cap (\beta,\infty)$}. The set {${\mathcal X}=\{0,\ldots,\beta\} \cup {\mathcal M}$} satisfies the following conditions: (1) ${\rm card}({\mathcal X})$ is greater than a huge positive integer and it is conjectured that ${\mathcal X}$ is infinite, (2)} we do not know any algorithm deciding the finiteness of ${\mathcal X}$, (3)~a~known and short algorithm for every {$n \in N$} decides whether or not {$n \in {\mathcal X}$}, (4) a known and short algorithm returns an integer~$n$ such that ${\mathcal X}$ is infinite if and only if ${\mathcal X}$ contains an element greater than $n$. The following problem is open: {\em simply define a set {${\mathcal X} \subseteq N$} such that ${\mathcal X}$ satisfies conditions (1)-(4), and \underline{we do not know any representation of~~${\mathcal X}$~~as a finite union of sets whose definitions are simpler than} \underline{the definition of ${\mathcal X}$}} {\tt (5)}. Let {$f(1)=2$}, {$f(2)=4$}, and let {$f(n+1)=f(n)!$} for every integer {$n \geqslant 2$}. For a positive integer $n$, let {$\Psi_n$} denote the following statement: {\em if a system of equations ${\mathcal S} \subseteq \Bigl\{x_i!=x_k: i,k \in \{1,\ldots,n\}\Bigr\} \cup \Bigl\{x_i \cdot x_j=x_k: i,j,k \in \{1,\ldots,n\}\Bigr\}$ has only finitely many solutions in positive integers \mbox{$x_1,\ldots,x_n$}, then each such solution \mbox{$(x_1,\ldots,x_n)$} satisfies {$x_1,\ldots,x_n \leqslant f(n)$}.} We prove that for every statement $\Psi_n$ the bound {$f(n)$} cannot be decreased. The author's guess is that the statements {$\Psi_1,\ldots,\Psi_9$} are true. We prove that the statement $\Psi_9$ implies that the set ${\mathcal X}$ of all {non-negative} integers $k$ whose number of digits belongs to {${\mathcal P}_{n^2+1}$} satisfies conditions {\tt (1)-(5)}.

We talk about random when it is not possible to determine a pattern on the observed outcomes. A computer follows a sequence of fixed instructions to give any of its output, hence the difficulty of choosing numbers randomly from algorithmic approaches. However, some algorithms based on mathematical formulas like the Linear Congruential algorithm and the Lagged Fibonacci generator appear to produce "true" random sequences to anyone who does not know the secret initial input [1]. Up to now, we cannot rigorously answer the question on the randomness of prime numbers [2, page 1] and this highlights a connection between random number generator and the distribution of primes. From [3] and [4] one sees that it is quite naive to expect good random reproduction with prime numbers. We are, however, interested in the properties underlying the distribution of prime numbers, which emerge as sufficient or insufficient arguments to conclude a proof by contradiction which tends to show that prime numbers are not randomly distributed. To achieve this end, we use prime gap sequence variation. The algorithm that we produce makes possible to deduce, in the case of a binary choice, a uniform behavior in the individual consecutive occurrence of primes, and no uniformity trait when the occurrences are taken collectively.

Matiyasevich's theorem states that there is no algorithm to decide whether or not a given Diophantine equation has a solution in non-negative integers. Smorynski's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. We prove: (1) Smorynski's theorem easily follows from Matiyasevich's theorem, (2 ) Hilbert's Tenth Problem for Q has a negative solution if and only if the set of all Diophantine equations with a finite number of rational solutions is not recursively enumerable.

We present a uniform method of density elimination for several semilinear substructural logics. Especially, the density elimination for the involutive uninorm logic IUL is proved. Then the standard completeness of IUL follows as a lemma by virtue of previous work by Metcalfe and Montagna.

Our method for density elimination is generalized to the non-commutative substructural logic GpsUL∗. Then the standard completeness of HpsUL∗follows as a lemma by virtue of previous workbyMetcalfeandMontagna. This result shows that HpsUL∗ is the logic of pseudo-uninorms and their residua and answered the question posed by Prof. Metcalfe, Olivetti, Gabbay and Tsinakis.

Two representable substructural logics ${\rm {\bf UL}}_\omega $ and ${\rm {\bf IUL}}_\omega $ are logics for finite UL and IUL-algebras, respectively. In this paper, the standard completeness of ${\rm {\bf UL}}_\omega $ and ${\rm {\bf IUL}}_\omega $ is proved by the method developed by Jenei, Montagna, Esteva, Gispert, Godo and Wang. This shows that ${\rm {\bf UL}}_\omega $ and ${\rm {\bf IUL}}_\omega $ are substructural fuzzy logics.

We know that quantum logics are the most prominent logical systems associated to the lattices of closed Hilbert subspaces. But what does it happen if, following a quantum computing perspective, we want to associate a logic to the process of quantum registers measurements? This paper gives an answer to this question, and, quite surprising, shows that such a logic is nothing else that the standard propositional intuitionistic logic.

Evolution of cooperation has traditionally been studied by assuming that individuals adopt either of two pure strategies, to cooperate or defect. Recent work have considered continuous cooperative investments, turning full cooperation and full defection into two opposing ends of a spectrum and sometimes allowing for the emergence of the traditionally-studied pure strategies through evolutionary diversification. These studies have typically assumed a well-mixed population in which individuals are encountered with equal probability, Here, we allow for the possibility of assortative interactions by assuming that, with specified probabilities, an individual interacts with one or more other individuals of the same strategy. A closely related assumption has previously been made in evolutionary game theory and has been interpreted in terms of relatedness. We systematically study the effect of relatedness and find, among other conclusions, that the scope for evolutionary branching is reduced by either higher average degree of, or higher uncertainty in, relatedness with interaction partners. We also determine how different types of non-linear dependencies of benefits and costs constrain the types of evolutionary outcomes that can occur. While our results overall corroborate the conclusions of earlier studies, that higher relatedness promotes the evolution of cooperation, our investigation gives a comprehensive picture of how relatedness affects the evolution of cooperation with continuous investments.

In this paper, some characterizations of fuzzifying strong compactness are given, including characterizations in terms of nets and pre -subbases. Several characterizations of locally strong compactness in the framework of fuzzifying topology are introduced and the mapping theorems are obtained.

We prove: (1) the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable, (2) the set of all Diophantine equations which have at most finitely many solutions in positive integers is not recursively enumerable, (3) the set of all Diophantine equations which have at most finitely many integer solutions is not recursively enumerable, (4) analogous theorems hold for Diophantine equations D(x₁, …, x_p) = 0, where p ∈ N\{0} and for every i ∈ {1, …, p} the polynomial D(x₁, …, x_p) involves a monomial M with a non-zero coefficient such that x_i divides M, (5) the set of all Diophantine equations which have at most k variables (where k ≥ 9) and at most finitely many solutions in non-negative integers is not recursively enumerable.

I introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic, and of neutrosophic propositional logic. In order for the paper to be self-contained, I also recall the etymology and definition of neutrosophy and of neutrosophic logic. Several examples are presented as well.

In this paper, we scrutinize the axiomatic system of effect algebras which is given by D. J. Foulis and M.K. Bennett in the paper Effect Algebras and Unsharp Quantum Logics. We prove that this axiomatic system consists of independent axioms. To do this, we construct some models to indicate the indepence of each axiom. Therefore none of these axioms can be reduced when constructing any effect algebra. As a result, any algebra is an effect algebra if and only if it verifies (E1)-(E4) axioms.