We introduce and study certain classes of optimization problems over the real numbers. The classes are defined by logical means, relying on metafinite model theory for so called R-structures . More precisely, based on a real analogue of Fagin's theorem [12] we deal with two classes MAX-NPR and MIN-NPR of maximization and minimization problems, respectively, and figure out their intrinsic logical structure. It is proven that MAX-NPR decomposes into four natural subclasses, whereas MIN-NPR decomposes into (...) two. This gives a real number analogue of a result by Kolaitis and Thakur [13] in the Turing model. Our proofs mainly use techniques from [17]. Finally, approximation issues are briefly discussed. (shrink)

We start with a simple proof of Leivant's normal form theorem for ∑11 formulas over finite successor structures. Then we use that normal form to prove the following:1. over all finite structures, every ∑21 formula is equivalent to a ∑21 formula whose first-order part is a Boolean combination of existential formulas, and2. over finite successor structures, the Kolaitis-Thakur hierarchy of minimization problems collapses completely and the Kolaitis-Thakur hierarchy of maximization problems collapses partially.The normal form theorem for ∑21 fails (...) if ∑21 is replaced with ∑11 or if infinite structures are allowed. (shrink)

In the context of solving large distributed constraint optimization problems, belief-propagation and incomplete inference algorithms are candidates of choice. However, in general, when the problem structure is very cyclic, these solution methods suffer from bad performance, due to non-convergence and many exchanged messages. As to improve performances of the MaxSum inference algorithm when solving cyclic constraint optimization problems, we propose here to take inspiration from the belief-propagation-guided decimation used to solve sparse random graphs. We propose the (...) novel DeciMaxSum method, which is parameterized in terms of policies to decide when to trigger decimation, which variables to decimate and which values to assign to decimated variables. Based on an empirical evaluation on a classical constraint optimization benchmarks, some of these combinations of policies, using periodic decimation, cycle detection-based decimation, parallel and non parallel decimation, random or deterministic variable selection and deterministic or random sampling for value selection, outperform state-of-the-art competitors in many settings. (shrink)

We consider a deterministic rewrite system for combinatory logic over combinators , and . Terms will be represented by graphs so that reduction of a duplicator will cause the duplicated expression to be "shared" rather than copied. To each normalizing term we assign a weighting which is the number of reduction steps necessary to reduce the expression to normal form. A lambda-expression may be represented by several distinct expressions in combinatory logic, and two combinatory logic expressions are considered equivalent if (...) they represent the same lambda-expression (up to --equivalence). The problem of minimizing the number of reduction steps over equivalent combinator expressions (i.e., the problem of finding the "fastest running" combinator representation for a specific lambda-expression) is proved to be NP-complete by reduction from the "Hitting Set" problem. (shrink)

Carnap's theory of descriptions was restricted in two ways. First, the descriptive conditions had to be non-modal. Second, only primitive predicates or the identity predicate could be used to predicate something of the descriptum . The motivating reasons for these two restrictions that can be found in the literature will be critically discussed. Both restrictions can be relaxed, but Carnap's theory can still be blamed for not dealing adequately with improper descriptions.

We study the position of the computable setting in the “common theory of locality” developed in [4, 5] for local problems on $\Delta $ -regular trees, $\Delta \in \omega $. We show that such a problem admits a computable solution on every highly computable $\Delta $ -regular forest if and only if it admits a Baire measurable solution on every Borel $\Delta $ -regular forest. We also show that if such a problem admits a computable solution on every computable (...) maximum degree $\Delta $ forest then it admits a continuous solution on every maximum degree $\Delta $ Borel graph with appropriate topological hypotheses, though the converse does not hold. (shrink)

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of combining prototypical concepts, an open problem in the fields of AI and cognitive modelling. Our logic extends the logic of typicality ALC + TR, based on the notion of rational closure, by inclusions p :: T(C) v D (“we have probability p that typical Cs are Ds”), coming from the distributed semantics of probabilistic Description Logics. Additionally, it embeds a set of cognitive heuristics (...) for concept combination. We show that the complexity of reasoning in our logic is EXPTIME-complete as in ALC. (shrink)

Could one give expression to a doctrine of essentialism without running afoul of semantical problems that are alleged to beggar systems of quantified modal logic? An affirmative answer is, I believe, called for at least in the case of individual essentialism. Individual essentialism is an ontological thesis concerning a kind of necessary connection between objects and their (essential) properties. It is not or anyhow not primarily a semantic thesis, a thesis about meanings, for example. And thus we are implicitly (...) counselled not to seek for the logical reconstruction of such necessities in theories in which necessity is a de ditto matter. A more natural-seeming target is an understanding of the structure of idioms of de re necessity. Of course, de re necessities may turn out to be special cases of necessities de ditto, with what consequences it is interesting to speculate upon, but it would be preferable if the theory of individual essences were to be prosecuted initially at least without prejudice to this other matter. A theory of individual essences therefore may find it a convenience to recognize a special category of open sentence by means of which to represent de re attributions of necessity. (shrink)

The investigation into logical form and structure of natural sciences and mathematics covers a significant part of contemporary philosophy. In contrast to this, the metatheory of normative theories is a slowly developing research area in spite of its great predecessors, such as Aristotle, who discovered the sui generis character of practical logic, or Hume, who posed the “is-ought” problem. The intrinsic reason for this situation lies in the complex nature of practical logic. The metatheory of normative educational philosophy and (...) theory inherits all the difficulties inherent in the general metatheory but has also significantly contributed to its advancement. In particular, the discussion on its mixed normative-descriptive character and complex composition has remained an important part of research in educational philosophy and theory. The two points seem to be indisputable. First, the content of educational philosophy and theory is a complex one, connecting different disciplines. Second, these disciplines are integrated within the logical form of practical inference or means-end reasoning. On the other hand, the character of consequence relation in this field, although generally recognized as specific, represents an unresolved prob- lem, a solution of which requires a sophisticated logical theory and promises to influence the self- understanding of educational philosophy and theory. (shrink)

We study a new formal logic LD introduced by Prof. Grzegorczyk. The logic is based on so-called descriptive equivalence, corresponding to the idea of shared meaning rather than shared truth value. We construct a semantics for LD based on a new type of algebras and prove its soundness and completeness. We further show several examples of classical laws that hold for LD as well as laws that fail. Finally, we list a number of open problems. -/- .

In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work (...) as computational models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes. (shrink)

The generation of route descriptions is a fundamental task of navigation systems. A particular problem in this context is to identify routes that can easily be described and processed by users. In this work, we present a framework for representing route networks with the qualitative information necessary to evaluate and optimize route descriptions with regard to ambiguities in them. We identify different agent models that differ in how agents are assumed to process route descriptions while navigating through route networks and (...) discuss which agent models can be translated into PDL programs. Further, we analyze the computational complexity of matching route descriptions and paths in route networks in dependency of the agent model. Finally, we empirically evaluate the influence of the agent model on the optimization and the processing of route instructions. (shrink)

The central focus of this article is the epistemological assumption that knowledge could be generated based on human beings’ experiences and over their conceptions of the world. Logical characterisation of human inductive learning over their produced conceptions within terminological systems and providing a logical background for theorising over the Human Concept Learning Problem (HCLP) in terminological systems are the main contributions of this research. In order to make a linkage between ‘Logic’ and ‘Cognition’, Description Logics (DLs) will (...) be employed to provide a logical description and analysis of actual human inductive reasoning (and learning). This research connects with the topics ‘logic & learning’, ‘cognitive modelling’, and ‘terminological knowledge representation’. (shrink)

The paper is devoted to applications of algebraic logic to databases. In databases a query is represented by a formula of first order logic. The same query can be associated with different formulas. Thus, a query is a class of equivalent formulae: equivalence here being similar to that in the transition to the Lindenbaum-Tarski algebra. An algebra of queries is identified with the corresponding algebra of logic. An algebra of replies to the queries is also associated with algebraic logic. These (...) relations lie at the core of the applications.In this paper it is shown how the theory of Halmos (polyadic) algebras (a notion introduced by Halmos as a tool in the algebraization of the first order predicate calculus) is used to create the algebraic model of a relational data base. The model allows us, in particular, to solve the problem of databases equivalence as well as develop a formal algebraic definition of a database's state description. In this paper we use the term "state description" for the logical description of the model. This description is based on the notion of filters in Halmos algebras. When speaking of a state description, we mean the description of a function which realizes the symbols of relations as real relations in the given system of data. (shrink)

Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though "solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks... it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs." (...) Presenting powerful, proven optimization techniques for logic inference problems, Chandru and Hooker show how optimization models can be used not only to solve problems in artificial intelligence and mathematical programming, but also have tremendous application in complex systems in general. They survey most of the recent research from the past decade in logic/optimization interfaces, incorporate some of their own results, and emphasize the types of logic most receptive to optimization methods-propositional logic, first order predicate logic, probabilistic and related logics, logics that combine evidence such as Dempster-Shafer theory, rule systems with confidence factors, and constraint logic programming systems. Requiring no background in logic and clearly explaining all topics from the ground up, Optimization Methods for Logical Inference is an invaluable guide for scientists and students in diverse fields, including operations research, computer science, artificial intelligence, decision support systems, and engineering. (shrink)

The question of which is the logic that underlies quantum physics does not have an absolute answer, but only in relation to a conventional choice of interpretation . Most of the interpretations that have been offered work within the framework of classical logic. In contrast to these, we examine the corpuscular interpretation which is assumed in the application of non-distributive logic . The experiment in which single photons pass through a Mach-Zehnder interferometer is examined, indicating the difficulty of employing a (...) realist corpuscular interpretation in this context. One way to save this interpretation would be to use non-distributive logic to analyze the experiment, but this is not satisfactory . However, the use of an alethic modal logic solves the problem, blocking the argument that put the aforementioned corpuscular interpretation into difficulty. In the discussion of the conceptual problems involved, we suggest that a stochastic corpuscular interpretation is well adapted to this logical description. The project of extending this modal logical approach to other experiments in quantum physics, and of providing a rigorous logical treatment, is left open. (shrink)

We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we say the property is recursively recognizable within some class of descriptions. When there is not, we ask how difficult it is to detect the property in an algorithmic sense. We consider descriptions of two sorts: first, recursive presentations in terms (...) of generators and relators, and second, algorithms for computing the group operation. For both classes of descriptions, we show that a large class of natural algebraic properties, Markov properties, are not recursively recognizable, indeed they are \-hard to detect in recursively presented groups and \-hard to detect in computable groups. These theorems suffice to give a sharp complexity measure for the detection problem of a number of typical group properties, for example, being abelian, torsion-free, orderable. Some properties, like being cyclic, nilpotent, or solvable, are much harder to detect, and we give sharp characterizations of the corresponding detection problems from a number of them. We give special attention to orderability properties, as this was a main motivation at the beginning of this project. (shrink)

This chapter summarizes Russell’s The Problems of Philosophy, presents new biographical details about how and why Russell wrote it, and highlights its continued significance for contemporary philosophy. It also surveys Russell’s famous distinction between “knowledge by acquaintance” and “knowledge by description,” his developing views about our knowledge of physical reality, and his views about our knowledge of logic, mathematics, and other abstract objects.

We shall in this paper try to present "a solution" of this problem and state with precision both the sense in which natural predicates "describe," while value predicates do not, and the sense in which value predicates "follow from" descriptive ones. We shall reach an unexpected result: not only are the value predicates "a different kind of predicates" from what the descriptive predicates are thought to be, but the descriptive predicates themselves are a different kind of predicates from what they (...) have been thought to be. They are one particular, and the most significant, set of value predicates. And it is precisely this special significance for valuation that makes them both "descriptive" and "factual"! (shrink)

The present attempt to indicate the general manner in which the kinship system of a people can be stated as an interpreted axiomatic system, with utilization of the symbolism of modern mathematical logic, is intended as a demonstration of the applicability of contemporary logical methods to problems in the social sciences. Aside from the obvious general advantages in the way of clarity and logical rigour to be gained by an application of axiomatic method, there emerges as by-products (...) a convenient system of kinship symbolization and what is believed to be a solution to the long-standing controversy concerning the use of the terms ‘descriptive’ and ‘classificatory’ in reference to kinship systems. Since kinship terms are words in languages, the present exposition is perhaps of interest in that it shows how meaning in a semantic field of related terms can be defined by logical methods. So all the directional or temporal terms in a specific language might be treated as kinship terms are here. The possibility of a systematic treatment of the semantic aspects of linguistics which so far have resisted this type of treatment should be of interest to linguists. (shrink)

Although the theory of definability had many important antecedents—such as the descriptive set theory initiated by the French semi-intuitionists in the early 1900s—the main ideas were first laid out in precise mathematical terms by Alfred Tarski beginning in 1929. We review here the basic notions of languages, explicit definability, and grammatical complexity, and emphasize common themes in the theories of definability for four important languages underlying, respectively, descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic. We review (...) the history of previous studies of the similarities and differences in the theories of definability of the first three of these four languages. A seminal role leading toward unification of the theories has been played by the separation principles introduced by Nikolai Luzin in 1927. Emphasizing analogies and driving toward further unification embracing finite-universe logic we concentrate on a simple example—the first and second separation principles for existential-universal first-order sentences . Using this as a test case for the fundamental problem of how to “finitize” arguments in classical pure logic to the finite-universe case, we are led to the analogous negative solution by using the theory of certain special graphs: a graph is - special for any positive integers m , n , p , q iff it is bipartite with m red points and n blue points and for every p -tuple of red points there is a blue point to which they are all connected . As an aside we introduce for further study a natural “Ramseyesque” increasing sequence A of positive integers, where A is the least positive integer n for which an -special graph exists. (shrink)

By introducing and extending description logic (DLs) and growing up their application in knowledge representation and especially in OWLs and semantic web scope, many shortcomings and bugs were identified that weren’t resolvable in classical DLs and so logicians and computer scientists intended to non-classical and non-monotonic reasoning tools. In this paper, I discuses about abduction problem solvers, and by introducing A-Box abduction in description logics (DLs), such as ALC, discuss about decidability and complexity in different introduced algorithms, and (...) report shortly our team’s advantages in developing and implementation of ΑBox abduction in DLs. (shrink)

A model of normative provisions and related axioms represented by using RDF/owl are presented as a contribution to implement the semantic web in the legal domain. In particular, a pattern able to implement the Hohfeldian legal fundamental relations between provisions using OWL-DL expressivity is proposed. Moreover, a query-based approach able to deal with relations between provision instances is described. An example of advanced access and reasoning over provisions using the proposed approach, as well as a prototype architecture of a provision (...) retrieval system, are shown. The main benefit is represented by the ability of the approach to keep the complexity of the problem within a description logic computational tractability. (shrink)

Natural language is full of patterns that appear to fit with general linguistic rules but are ungrammatical. There has been much debate over how children acquire these “linguistic restrictions,” and whether innate language knowledge is needed. Recently, it has been shown that restrictions in language can be learned asymptotically via probabilistic inference using the minimum description length (MDL) principle. Here, we extend the MDL approach to give a simple and practical methodology for estimating how much linguistic data are required (...) to learn a particular linguistic restriction. Our method provides a new research tool, allowing arguments about natural language learnability to be made explicit and quantified for the first time. We apply this method to a range of classic puzzles in language acquisition. We find some linguistic rules appear easily statistically learnable from language experience only, whereas others appear to require additional learning mechanisms (e.g., additional cues or innate constraints). (shrink)

In this paper we examine the theory of historical explanation presented by Arthur Danto in his book, Analytical Philosophy of History (1965).Our thesis is that Danto is mistaken in his assertion that a phenomenon can be covered by a general law only insofar as we produce a description of it which contains no uneliminable particular designations of it. It is possible to cover such particular statements with general laws provided one can bridge the logical gap between the two (...) types of sentence with other statements which need not be redescriptions of the phenomenon but can be independently established premises for a deductive argument.We further show that some of the analogies which Danto attempts to make between deduction and narrative are mistaken because of errors in Danto's understanding of logical theory, specifically, Danto's notion that no predicate may appear in the conclusion of a deductive argument which is not antecedently contained in the premises and his claim that the same variable must be replaced by the same constants throughout an argument. (shrink)

Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of programs (such as propositional (...) dynamic logic), for which tableau procedures have been quite successful.Nevertheless, due to different underlying institutions and applications, most description logics differ significantly from run-of-the-mill modal and program logics. Consequently, the research on tableau algorithms in description logics led to new techniques and results, which are, however, also of interest for modal logicians. In this article, we will focus on three features that play an important rôle in description logics (number restrictions, terminological axioms, and role constructors), and show how they can be taken into account by tableau algorithms. (shrink)

This paper addresses the job shop scheduling problem including time lag constraints. This is an extension of the job shop scheduling problem with many applications in real production environments, where extra delays can be introduced between successive operations of the same job. It belongs to a category of problems known as NP-hard problem due to large solution space. Biogeography-based optimization is an evolutionary algorithm which is inspired by the migration of species between habitats, recently proposed by Simon in (...) 2008 to optimize hard combinatorial optimization problems. We propose a hybrid biogeography-based optimization algorithm for solving the job shop scheduling problem with additional time lag constraints with minimization of total completion time. In the proposed HBBO, the effective greedy constructive heuristic is adapted to generate the initial population of habitat. Moreover, a local search metaheuristic is investigated in the mutation step in order to ameliorate the solution quality and enhance the diversity of the population. To assess the performance of HBBO, a series of experiments on well-known benchmark instances for job shop scheduling problem with time lag constraints is performed. (shrink)

The theory of visual perception that Irvin Rock develops and supports in this book with numerous original experiments, views perception as the outcome of a process of unconscious inference, problem solving, and the building of structural descriptions of the external world.

Acquaintance, Knowledge, and Logic (awarded the 2016 Bertrand Russell Society Book Prize) brings together ten new essays on Bertrand Russell's best-known work, The Problems of Philosophy. These essays, by some of the foremost scholars of his life and works, reexamine Russell's famous distinction between “knowledge by acquaintance” and “knowledge by description,” his developing views about our knowledge of physical reality, and his views about our knowledge of logic, mathematics, and other abstract objects. In addition, this volume includes an (...) editors' introduction, which summarizes Russell's influential book, presents new biographical details about how and why Russell wrote it, and highlights its continued significance for contemporary philosophy. (shrink)

When we reason about strategic games, implicitly we need to reason about arbitrary strategy profiles and how players can improve from each profile. This structure is exponential in the number of players. Hence it is natural to look for subclasses of succinct games for which we can reason directly by interpreting formulas on the (succinct) game description rather than on the associated improvement structure. Priority separable games are one of such subclasses: payoffs are specified for pairwise interactions, and from (...) these, payoffs are computed for strategy profiles. We show that equilibria in such games can be described in Monadic Least Fixed Point Logic (MLFP). We then extend the description to games over arbitrarily many players, but using the monadic least fixed point extension of existential second order logic. (shrink)

This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of (...) the field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University Bochum, June 2012. (shrink)

This chapter contains sections titled: Preliminaries Descriptions and Quantification Descriptions and Predication Conclusion.

Formalism in the philosophy of mathematics has taken a variety of forms and has been advocated for widely divergent reasons. In Sects. 1 and 2, I briefly introduce the major formalist doctrines of the late nineteenth and early twentieth centuries. These are what I call empirico-semantic formalism, game formalism and instrumental formalism. After describing these views, I note some basic points of similarity and difference between them. In the remainder of the paper, I turn my attention to Hilbert’s instrumental formalism. (...) My primary aim there will be to develop its formalist elements more fully. These are, in the main, its rejection of the axiom-centric focus of traditional model-construction approaches to consistency problems, its departure from the traditional understanding of the basic nature of proof and its distinctively descriptive or observational orientation with regard to the consistency problem for arithmetic. More specifically, I will highlight what I see as the salient points of connection between Hilbert’s formalist attitude and his finitist standard for the consistency proof for arithmetic. I will also note what I see as a significant tension between Hilbert’s observational approach to the consistency problem for arithmetic and his expressed hope that his solution of that problem would dispense with certain epistemological concerns regarding arithmetic once and for all. (shrink)

The text considers the impossibility of abstracting away from the sense of formal con­structions in logical and mathematical researches. The validity of the application of the “formal methodology” is allowed only after some system of conventional notations and agreements has been accepted. The context determined by such agreements is called formal. A correlation of constructions and results obtained by formal methods within sev­eral formal contexts is impossible without a consideration of the various semantic aspects of the correlated formal constructions. (...) The author calls such correlations intercontextual. The paper examines two examples of such intercontextual comparisons to demonstrate the necessity of taking into account different semantic components of the compared for­mal constructions. In the context of these conclusions, the author raises the question of the structure and origin of some senses of the “symbols” used in formal constructions and of the “sequences of symbols” constructed from them. The author identifies three main sources of the semantic load carried by formal constructions. Firstly, these are the various aspects of semiotic usage: first of all, the general cultural and general profes­sional semiotic skills of the “interpreter”. Secondly, it is the sense given to formal con­structions by verbal comments, descriptions of the construction process and the associ­ated knowledge of the “interpreter”. Thirdly, these are the senses set by the formal con­structions themselves: at the stage of defining a formal language and at the stage of con­structing a formal deductive or semantic system. The author also considers the fallacy of the assumption of the existence of some universal “global intuition” associated with the very possibility of formal methodology. (shrink)

Packing optimization problems have a wide spectrum of real-word applications. One of the applications of the problems is problem of placement of containers with spent nuclear fuel on the storage platform. The solution of the problem can be reduced to the solution of the problem of finding the optimal placement of a given set of congruent circles into a multiconnected domain taking into account technological restrictions. A mathematical model of the prob-lem is constructed and its peculiarities are (...) considered. Our approach is based on the mathematical modelling of rela-tions between geometric objects by means of phi-function technique. That allowed us to reduce the problem solving to nonlinear programming. Today, an important scientific problem is the problem of creating conditions for safe storage of spent nuclear fuel. In the process of creating any dry spent nuclear fuel storage, the following main stages can be identified: site selection, storage design, construction, operation and decommissioning. A full check for compliance of the repository and its elements with these standards usually begins at the design stage. At the stage of site selection, the inspection for compliance with safety standards is carried out only in terms of the impact of the repository as a whole on the environment. This approach cannot be considered fully appropriate, because, taking into account, for example, all the climatic features of the future storage site, it is possible to adjust the thermal storage regimes of spent nuclear fuel. Similarly, it can be considered necessary to analyze and select the shape of the storage site in order to accommo-date the maximum possible number of spent fuel containers. Such a choice, obviously, should be made taking into ac-count the norms of nuclear, radiation and thermal safety, as well as in compliance with technological limitations. The problem of finding the optimal placement of containers taking into account the given technological limitations can be formulated in the form of the problem of optimization of geometric design. Therefore, the purpose of the study is to build a mathematical model of the problem and study its characteristics to develop effective methods of solution. The proposed approach is based on mathematical modeling of relations between geometric objects using the method of phi-functions. This allowed to reduce the solution of the problem to the problem of nonlinear programming. (shrink)

This book provides a systematic and comprehensive description of Non-Axiomatic Logic, which is the result of the author's research for about three decades.Non-Axiomatic Logic is designed to provide a uniform logical foundation for Artificial Intelligence, as well as an abstract description of the “laws of thought” followed by the human mind. Different from “mathematical” logic, where the focus is the regularity required when demonstrating mathematical conclusions, Non-Axiomatic Logic is an attempt to return to the original aim of (...) logic, that is, to formulate the regularity in actual human thinking. To achieve this goal, the logic is designed under the assumption that the system has insufficient knowledge and resources with respect to the problems to be solved, so that the “logical conclusions” are only valid with respect to the available knowledge and resources. Reasoning processes according to this logic covers cognitive functions like learning, planning, decision making, problem solving, etc.This book is written for researchers and students in Artificial Intelligence and Cognitive Science, and can be used as a textbook for courses at graduate level, or upper-level undergraduate, on Non-Axiomatic Logic. (shrink)

B a c k g r o u n d. The article is devoted to the analysis of the key directions of the study of the possible influence of the specifics of Chinese language culture on the content and nature of intellectual discourse, which is recognized as philosophical. Logic and ontology are the key areas of analysis of the possible influence of linguistic determinants on the intellectual discourse of China. Three main topics that attract the attention of researchers are the (...) structure of judgment, the semantics of lexical units, and the specificity of the pragmatics of the Chinese language. M e t h o d s. The author applied general scientific methods of analysis, synthesis, comparison and description of the works of researchers of Chinese philosophy, which justify and argue the fruitfulness of studying the peculiarities of Chinese language to explain the reasons of the fundamental difference between the problems actualized in the history of Chinese philosophy and those that formed the basis of the development of the history of philosophy in the Western world. R e s u l t s. It is generally accepted that for the worldview of representatives of Chinese culture, the world is a structural whole, consisting of elements that continuously interact in the dynamics of changes and transformations, we find a reflection of this feature in the semantics of the corresponding symbolic system. Polysemy in the Chinese language mostly reveals a complex and multi-layered "web" of associative and correlative connections between meanings, which in fact cannot be argued outside the context of the relevant cultural tradition indicating common features or similarities of the signified. The doubt about the typicality of understanding the denotations as fixed and atomized for the Chinese language culture is reasonable, even in those cases when it comes to the designation of empirically accessible objectivity. The main specific features of polysemy in the Chinese language are the complete heterogeneity of what is signified, and the lack of transparent grounds for identifying the genus-species subordination of the scope of general concepts. This can also serve as an explanation for the fact that we do not find a completely obvious and nondisputable analogue of the problem of universals of the Western model in the history of Chinese philosophy. C o n c l u s i o n s. Based on the peculiarities of the Chinese language culture, we can recognize as a reasonable a statement that the seemingly natural understanding of the essence – the subject, as something that remains the same (at least for a certain time), but it undergoes some changes through its manifestations – a predicate (properties and actions). It is not as necessary and axiomatic for Chinese thinkers as, for example, for ancient Greek philosophers. In addition, we can recognize the fact that the verb "to exist" does not fulfill the role of a necessary copula in judgments in the Chinese language, as a probable reason for the lack of fundamental problematization of the concept of "being" in the Chinese history of philosophy. In general, the context of the use of a certain word-sign in the Chinese language plays a determining role. The actualization of one or another meaning in an expression is formed not only by its integration into a certain text, but also by its purpose in accordance with the specific practice of application. Therefore, this can serve as an explanation for the absence of an original and axiomatic interpretation of truth as absolute, that is, unchanging and non-relative in the history of Chinese philosophy. (shrink)

Application of the reliability of repairable systems on solving problems from constructing production systems takes an important place in the process of finding the optimal solution among the suggested system choices. The basic hypothesis when using the reliability of the repairable systems is that every machine is representing a component, a fact that is debatable when talking about technical sciences. However, considering the second assumption of the stationary process, the function of the availability is introduced. It represents the measure (...) between the reliability and the benefit of maintaining the components and the system as a whole one. An additional and the last reason for analyzing constructing machine as a whole one has an economic reason. From the aspect of the total cost and the capacity of the system, the function of the availability is catching more and more impact in the process of determinating the total cost in bill of quantities as the most important part of tender documents. Until former works, techno-economic optimisation usually ran over when choosing the system of the construction machines. In the work, there are shown the methodologies for gathering and analyzing the indicators of availabilities per unit of a company's machine park. The time of demission and reparation have been investigated among 34 components in the period of 6 years. Based on the obtained result for different conditions of machine exploitation and facilities, it is suggested the methodology of the future behaviour of the corresponding within the model optimization availability of constructing production system with the aim of eliminating extra criterion. The suggested model takes in consideration the total cost of the components when they are functional, and when they are not. This kind of approach enables the one who take choices decision of the height of profits, in the lenght of work in function of the projection of cash flow and managing with real indicators of functioning the system at the project level. Given the fact that the maintanance policy of machines is based on availability, and not on reliability of components, with the aim of maximizing the availability of different budget scenarios, a logical approach to the selection of the objective function in the terms of management of construction production systems is to minimize costs for a given availability of system constructing machinery is based on the use of historical data base with the values of the operational availability of components, conditions in which they function, in the process of forecasting the project availability for projects that follow. Ranking variant solutions is the result of the adopted function of the aim as a consequence due to enlargement methods of availability for serial parallel systems with the associated restrictions. For optimal system availability is taken a value that belongs to minimal total cost. However, it is predicted that after the end of the financial year, the real and projected indicators of system functions get compared to each other. Informational support to the proposed model is informational company system, which was built in the PHP programming language on the Linux software platform, and with data based in My SQL. The suggested model is tested on the system for the production and embedding bitumen bound materials on the specific project. Obtained results confirm the assumptions used in work. (shrink)

In the first chapter I have introduced Carnapian intensional logic against the background of Frege's and Quine's puzzles. The main body of the dissertation consists of two parts. In the first part I discussed Carnapian modal logic and arithmetic with descriptions. In the second chapter, I have described three Carnapian theories, CCL, CFL, and CNL. All three theories have three things in common. First, they are formulated in languages containing description terms. Second, they contain a system of modal logic. (...) Third, they do not contain the unrestricted classical substitution principle, but they do contain the classical substitution principle restricted to non-modal formulas and the Carnapian substitution principle, which says that two terms can be substituted salva veritate if they are necessarily coreferential. There are two major differences between the three theories. First, CCL and CFL allow universal instantiation with description terms, whereas CNL does not. Moreover, the quantificational theory of the CCL is classical, whereas the quantificational theory of CFL is a free logic. Another difference is that CCL and CFL contain different description principles. Most importantly, the description principle of CCL ensures that even improper descriptions have a denotation, whereas the description principle of CFL does not guarantee this. CNL does not have a description principle. In the third chapter, I have studied collapse arguments for CCL, CFL, and CNL. A collapse argument is an argument for the following statement: if p is true, then it is necessarily true. A crucial role in the proofs of these collapse results was played by so-called self-predication principles, which say that under certain conditions the predicate that expresses the descriptive condition can be combined by the description term formed out of that predicate with the result being a true sentence. In this chapter I have discussed a collapse argument for the extension of CCL with a self-predication principle, I have given a collapse argument for a similarly extended CFL, and most importantly, I have given a collapse argument for the extension of CNL with a self- predication principle. Finally, I have argued that the relevant self-predication principles are unsound under a Carnapian interpretation. In the fourth chapter, I have studied the extension of Peano Arithmetic with a Carnapian modal logic C, which is a dummy letter standing for either CCL or CFL. One can prove that the principle of the necessity of identity is a theorem of CPA. This implies that one gets a collapse result for CPA. The standard principle of weak induction was crucial for the proof. One can also prove that, if one assumes a particular self-predication principle, and if one assumes the principle of strong induction or, equivalently, the least-number principle, then one gets a partial collapse of de re modal truths in de dicto modal truths. I have argued that, if the box operator is interpreted as a metaphysical necessity operator, then Platonists would not be inimical to the collapse result. But if CPA is extended with a physical theory, then there is a threat that physical truths become physical necessiti es. It was shown that, under a Carnapian interpretation, the standard principle of weak induction is unsound, and that it can be replaced by a Carnapian principle of weak induction that is sound. The problem of logical and mathematical omniscience prevents ordinary Carnapian intensional logic from being taken seriously as a logic adequate for describing the principles of demonstrability. Yet many of the proof-theoretic results of the first part carry over to the part on Carnapian epistemic arithmetic with descriptions, since proof-theoretic results are independent of the informal reading of the operators. In the fifth chapter, I looked at extensions of arithmetic with a modal logic in which the box operator is interpreted as a demonstrability operator. A first extension in that sense is Shapiro s Epistemic Arithmetic. Shapiro himself offered the problem of mathematical omniscience as a reason why it is difficult to find a model theory for EA. Horsten attempted to provide a model theory via the detour of Modal-Epistemic Arithmetic. The attention of the reader was drawn to an incoherence in the model theory of. Two alternative solutions were presented and, after a short discussion of the problem of de re demonstrability one of those alternatives was chosen. The discussion of the problem of de re demonstrability made it clear that it would be interesting to study the epistemic properties of notation systems. Horsten himself provided a framework for this, viz. Carnapian Epistemic Arithmetic, and he started a systematic study of the epistemic properties of notation systems within that framework. However, he did not provide non-trivial but adequate models. To make a start with solving the problem of finding good models for CEA, I introduced Carnapian Modal-Epistemic Arithmetic In constructing CMEA I incorporated the lesson about the principle of weak induction learnt in the fourth chapter. In the sixth chapter, I gave a critical assessment of an argument concerning the limits of de re demonstrability about the natural numbers. The conclusion of the Description Argument is that it is undemonstrable that there is a natural number that has a certain property but of which it is undemonstrable that it has that property. A crucial step in the Description Argument involved a self-predication principle. Making good use of one of the results obtained in the third chapter, I proved a collapse result for the background theory against which the Description Argument was formulated. I concluded that either the either the Description Argument is sound but its conclusion is trivial, o r the Description Argument is unsound, or it is a cheapshot. As an appendix I included an article co-authored by prof. dr. Leon Horsten and me. The topic of the article is indirectly related to some other topics investigated in my dissertation. Also, it backs up one of the addition al theses I might be asked to publicly defend during my doctoral exam. T he topic of the appendix is the set of the so-called paradoxes of strict implication. Jonathan Lowe has argued that a particular variation on C.I. Lewis notion of strict implication avoids the paradoxes of strict implication. Pace Lowe, it is argued that Lowe s notion of implication does not achieve this aim. Moreover, a general argument is offered to the effect that no other variation on Lewis notion of constantly strict implication describes the logical behaviour of natural language conditional s in a satisfactory way. (shrink)

Due to their acceptance of the verifiability principle, the only way left for logical positivists to argue for the meaningfulness of religious language was to accept some sort of emotivistic conception of it or to reduce it to the description of religious attitude. The verifiability principle, however, suffers from some severe limitations that make it inadequate as a criterion for cognitive meaning. To resolve these problems, logical positivists gave up the requirement of conclusive verifiability and defended (...) a sort of ‘liberalization’ of the verifiability principle. Carnap’s confirmability criterion for cognitive meaning, which is a liberalized form of the verifiability principle, is compatible with an orthodox conception of religious language since, from a theistic perspective, the existence of God can be confirmed through our observational statements. (shrink)

A new approach to Hume's problem of induction that justifies the optimality of induction at the level of meta-induction. Hume's problem of justifying induction has been among epistemology's greatest challenges for centuries. In this book, Gerhard Schurz proposes a new approach to Hume's problem. Acknowledging the force of Hume's arguments against the possibility of a noncircular justification of the reliability of induction, Schurz demonstrates instead the possibility of a noncircular justification of the optimality of induction, or, more precisely, of meta-induction (...) (the application of induction to competing prediction models). Drawing on discoveries in computational learning theory, Schurz demonstrates that a regret-based learning strategy, attractivity-weighted meta-induction, is predictively optimal in all possible worlds among all prediction methods accessible to the epistemic agent. Moreover, the a priori justification of meta-induction generates a noncircular a posteriori justification of object induction. Taken together, these two results provide a noncircular solution to Hume's problem. Schurz discusses the philosophical debate on the problem of induction, addressing all major attempts at a solution to Hume's problem and describing their shortcomings; presents a series of theorems, accompanied by a description of computer simulations illustrating the content of these theorems (with proofs presented in a mathematical appendix); and defends, refines, and applies core insights regarding the optimality of meta-induction, explaining applications in neighboring disciplines including forecasting sciences, cognitive science, social epistemology, and generalized evolution theory. Finally, Schurz generalizes the method of optimality-based justification to a new strategy of justification in epistemology, arguing that optimality justifications can avoid the problems of justificatory circularity and regress. (shrink)

In order to explain that sentences containing empty definite descriptions are nevertheless true or false, Russell famously analyzes sentences of the form ‘The F is G’ as ‘There is exactly one F and it is G’. Against this it has been objected that Russell’s analysis provides the wrong truth-conditions when it comes to non-doxastic attitude ascriptions. For example, according to Heim, Kripke, and Elbourne (HKE), there are circumstances in which (1) is true and (2) is false. Hans wants the ghost (...) in his attic to be quiet tonight.Hans wants there to be exactly one ghost in his attic and for it to be quiet tonight. After all, the argument goes, unlike (2), (1) can be true without Hans wanting there to be exactly one ghost in his attic. Kaplan and Neale famously reply that the HKE objection presupposes that non-doxastic attitudes are closed under entailment, which they are not. For Rostworowski, on the other hand, the problematic principle used by the HKE objection is a substitutivity principle for non-doxastic attitude ascriptions. This is further supported by the fact that, as Elbourne points out, Russell’s analysis already leads to a problem similar to the HKE objection together with substitutivity alone. By questioning substitutivity for non-doxastic attitude ascriptions, Rostworowski tries to block both the HKE objection and Elbourne’s variant of the HKE objection. In this paper, I will argue that Russell’s analysis of definite descriptions leads to a variant of the HKE objection even in the context of doxastic attitude ascriptions. Since, as we will see, doxastic attitude ascriptions do not seem to suffer from the substitutivity problems discussed by Rostworowski in the context of non-doxastic attitude ascriptions, this will further exacerbate the problem for Russell’s analysis. I will then discuss the possibility to reject substitutivity for doxastic attitude ascriptions using a contextualist analysis of attitude ascriptions. However, we will see that, independent of whether we accept substitutivity for doxastic attitude ascriptions, a complete solution of the doxastic problem has to reject Russell’s analysis of the truth-conditions of sentences of the form ‘The F is G’. Concluding, I will show that, unlike Russell’s analysis, the Frege–Strawson analysis of definite descriptions, according to which a sentence of the form ‘The F is G’ presupposes that there is exactly one F, rather than asserting it, provides an explanation of the HKE objection, Elbourne’s variant of the HKE objection, and the doxastic problem presented in this paper. This will speak not only in favor of a Fregean analysis of definite descriptions, but also of a Fregean conception of propositions. (shrink)

The most forceful philosophical objections to belief in God arise from the existence of evil. Bad things happen in the world and it is not clear how this is compatible with the existence of an all-powerful and perfectly loving being. Unsurprisingly then, philosophers have formulated powerful arguments for atheism based on the existence of apparently unjustified suffering. These arguments give expression to what we call the problem of evil. This volume is an engaging introduction to the philosophical problem of evil. (...) Daniel Speak provides a clear overview of the main lines of reasoning in this debate and argues for the defensibility of theistic belief in the face of evil. He fleshes out the distinction between theodicy and defense and guides the reader through the logical, evidential, and hiddenness versions of the problem."--Publisher's description. (shrink)