Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 8

first rewind previous Page / 1 next fast forward last

Search results

help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
EN
In this paper we consider perspectives of application of coinductive and corecursive methods of non-well-founded mathematics to philosophical logic. So, it is shown that the problem of analysis can be solved by using greatest fixed points. Means of well-founded mathematics are enough only for an explication of the trivial analysis. We claim that the nontrivial analysis should be explicated by means of non-well-funded mathematics. Further, we build a non-well-founded propositional logic with syntax and semantics whose objects are defined by coinduction as streams. We also survey perspectives of relationship between non-well-founded logics and unconventional computing.
EN
Finite foundations of mathematics developed by D. Hilbert are presently considered in computer science as an original mathematical canon. Nevertheless, transfinite foundations of mathematics proposed by G. Cantor can also be urgent for soft computing. In this paper the author considers some perspectives of transfinite foundations, namely he proposes non-Archimedean foundations of mathematics and non-Archimedean multiple-validity. Further, he constructs a logical language with non-Archimedean valued semantics.
EN
In this paper I consider the historical background of Hebrew Orthodoxy finally formed in Belarusian lands. Further, I try to explicate the Judaic logic (i.e. the logic used by Talmudists for inferring Judaic laws from the Pentateuch). The only logical connective of that logic is the Judaic conjunction 'and' which is not idempotent or commutative, but it is associative. I propose Austin's style of semantics for Judaic logic and explicate also the inference rules used by Talmudists. I show that the Judaic logic is characterized by non-well-foundedness.
EN
In the paper I consider abstract machine of reaction-diffusion computing. This machine is constructed by using process algebra. Further, I propose proof-theoretic interpretation of process calculus within the framework of Belousov-Zhabotinsky reaction. I show that some proofs simulating the behaviour of Belousov-Zhabotinsky reaction are circular. This means that the derivation tree simulating the behaviour tree of Belousov-Zhabotinsky reaction has cycles, i.e. some derivable formulas occur among top premisses.
EN
In the paper I sketched some applications of non-Kolmogorovian probabilities (including complex- and non-Archimedean-valued) and non-Archimedean fuzziness in the CADIAG expert system. This work I started this year.
EN
In this paper we have traced some basic attributes belonging to the Mesopotamian goddess Nanāia, from their origin in the period of Ur III (2112–2004 BC) in ancient Mesopotamia up to the period of the Kuṣāṇas and Kūšānšāhs (from the 1st century AD to the late 4th century AD) in Central and South Asia, and up to the period of their successors – the Kidarites and Hephthalites. We have shown that there was a smooth transformation of these attributes of Nanāia to the standard Indian iconographic motif of Durgā.
EN
In the paper we consider some principal notions of non-well-founded proof theory in argumentation. This theory is based on the assumption of Anti-Foundation Axiom that every graph tree has a unique decoration. A decoration of a graph is an assignment of a derivable formula to each node of the graph in such a way that the premisses of the root-derivable formula assigned to a node are the derivable formulas assigned to the children of that node. According to Anti-Foundation Axiom in proof theory, cyclic graph and infinite graph trees have a decoration too. This means that there are cyclic and infinite proof trees. The natural interpretation of cyclic proofs in argumentation is their consideration as confirmation procedure, where premisses are compatible with a derivable statement, but they do not prove this in the standard meaning. As model example we use the case of excluding Boris Pasternak from the Association of Writers of the USSR.
EN
In this paper we consider an interaction between the reflection in the scientific activity and the scientific habitus. We claim that the ultimate goal of scientific activity consists in the desire to affect the scientific behavior of other scientists. As a rule, this means that scientific results are recognized more or less fundamental and depending on the fact that they determine scientific interests of the whole community of scientists. Accordingly, the scientific activity, which has entailed a serious discovery or invention, becomes a standard for the research behavior of the majority of members of scientific community. As a result, the given discovery or invention becomes the important part of scientific habitus (the embodied, interiorized social structure in scientific activity). The reflection in the scientific activity is a human ability that allows us to oppose the scientific habitus and not to subordinate the logical level of scientific argumentation to the dialectical level and the latter to the rhetorical level of scientific argumentation.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.