Results for 'Yaroslav Sergeyev'

(not author) ( search as author name )
124 found
Order:
  1.  68
    Independence of the Grossone-Based Infinity Methodology From Non-Standard Analysis and Comments Upon Logical Fallacies in Some Texts Asserting the Opposite.Yaroslav Sergeyev - 2019 - Foundations of Science 24 (1):153-170.
    This paper considers non-standard analysis and a recently introduced computational methodology based on the notion of ①. The latter approach was developed with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework and in all the situations requiring these notions. Non-standard analysis is a classical purely symbolic technique that works with ultrafilters, external and internal sets, standard and non-standard numbers, etc. In its turn, the ①-based methodology does not use any of these (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  2. Numerical Infinities and Infinitesimals: Methodology, Applications, and Repercussions on Two Hilbert Problems.Yaroslav Sergeyev - 2017 - EMS Surveys in Mathematical Sciences 4 (2):219–320.
    In this survey, a recent computational methodology paying a special attention to the separation of mathematical objects from numeral systems involved in their representation is described. It has been introduced with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework in all the situations requiring these notions. The methodology does not contradict Cantor’s and non-standard analysis views and is based on the Euclid’s Common Notion no. 5 “The whole is greater than the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3. Solving Ordinary Differential Equations by Working with Infinitesimals Numerically on the Infinity Computer.Yaroslav Sergeyev - 2013 - Applied Mathematics and Computation 219 (22):10668–10681.
    There exists a huge number of numerical methods that iteratively construct approximations to the solution y(x) of an ordinary differential equation (ODE) y′(x) = f(x,y) starting from an initial value y_0=y(x_0) and using a finite approximation step h that influences the accuracy of the obtained approximation. In this paper, a new framework for solving ODEs is presented for a new kind of a computer – the Infinity Computer (it has been patented and its working prototype exists). The new computer is (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  4. The Exact (Up to Infinitesimals) Infinite Perimeter of the Koch Snowflake and its Finite Area.Yaroslav Sergeyev - 2016 - Communications in Nonlinear Science and Numerical Simulation 31 (1-3):21–29.
    The Koch snowflake is one of the first fractals that were mathematically described. It is interesting because it has an infinite perimeter in the limit but its limit area is finite. In this paper, a recently proposed computational methodology allowing one to execute numerical computations with infinities and infinitesimals is applied to study the Koch snowflake at infinity. Numerical computations with actual infinite and infinitesimal numbers can be executed on the Infinity Computer being a new supercomputer patented in USA and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  79
    The Olympic Medals Ranks, Lexicographic Ordering and Numerical Infinities.Yaroslav Sergeyev - 2015 - The Mathematical Intelligencer 37 (2):4-8.
    Several ways used to rank countries with respect to medals won during Olympic Games are discussed. In particular, it is shown that the unofficial rank used by the Olympic Committee is the only rank that does not allow one to use a numerical counter for ranking – this rank uses the lexicographic ordering to rank countries: one gold medal is more precious than any number of silver medals and one silver medal is more precious than any number of bronze medals. (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  6. Single-Tape and Multi-Tape Turing Machines Through the Lens of the Grossone Methodology.Yaroslav Sergeyev & Alfredo Garro - 2013 - Journal of Supercomputing 65 (2):645-663.
    The paper investigates how the mathematical languages used to describe and to observe automatic computations influence the accuracy of the obtained results. In particular, we focus our attention on Single and Multi-tape Turing machines which are described and observed through the lens of a new mathematical language which is strongly based on three methodological ideas borrowed from Physics and applied to Mathematics, namely: the distinction between the object (we speak here about a mathematical object) of an observation and the instrument (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7. A New Applied Approach for Executing Computations with Infinite and Infinitesimal Quantities.Yaroslav D. Sergeyev - 2008 - Informatica 19 (4):567-596.
    A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle ‘The part is less than the whole’ introduced by Ancient Greeks and applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). It is shown that it becomes possible to write down finite, infinite, and infinitesimal numbers by a finite number of symbols as particular cases of a unique framework. The (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   5 citations  
  8.  91
    Arithmetic of Infinity.Yaroslav D. Sergeyev - 2013 - E-book.
    This book presents a new type of arithmetic that allows one to execute arithmetical operations with infinite numbers in the same manner as we are used to do with finite ones. The problem of infinity is considered in a coherent way different from (but not contradicting to) the famous theory founded by Georg Cantor. Surprisingly, the introduced arithmetical operations result in being very simple and are obtained as immediate extensions of the usual addition, multiplication, and division of finite numbers to (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  9. Higher Order Numerical Differentiation on the Infinity Computer.Yaroslav Sergeyev - 2011 - Optimization Letters 5 (4):575-585.
    There exist many applications where it is necessary to approximate numerically derivatives of a function which is given by a computer procedure. In particular, all the fields of optimization have a special interest in such a kind of information. In this paper, a new way to do this is presented for a new kind of a computer - the Infinity Computer - able to work numerically with finite, infinite, and infinitesimal number. It is proved that the Infinity Computer is able (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  10. Interpretation of Percolation in Terms of Infinity Computations.Yaroslav Sergeyev, Dmitri Iudin & Masaschi Hayakawa - 2012 - Applied Mathematics and Computation 218 (16):8099-8111.
    In this paper, a number of traditional models related to the percolation theory has been considered by means of new computational methodology that does not use Cantor’s ideas and describes infinite and infinitesimal numbers in accordance with the principle ‘The part is less than the whole’. It gives a possibility to work with finite, infinite, and infinitesimal quantities numerically by using a new kind of a compute - the Infinity Computer – introduced recently in [18]. The new approach does not (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  11.  88
    Using Blinking Fractals for Mathematical Modelling of Processes of Growth in Biological Systems.Yaroslav Sergeyev - 2011 - Informatica 22 (4):559–576.
    Many biological processes and objects can be described by fractals. The paper uses a new type of objects – blinking fractals – that are not covered by traditional theories considering dynamics of self-similarity processes. It is shown that both traditional and blinking fractals can be successfully studied by a recent approach allowing one to work numerically with infinite and infinitesimal numbers. It is shown that blinking fractals can be applied for modeling complex processes of growth of biological systems including their (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  12.  33
    The Difficulty of Prime Factorization is a Consequence of the Positional Numeral System.Yaroslav Sergeyev - 2016 - International Journal of Unconventional Computing 12 (5-6):453–463.
    The importance of the prime factorization problem is very well known (e.g., many security protocols are based on the impossibility of a fast factorization of integers on traditional computers). It is necessary from a number k to establish two primes a and b giving k = a · b. Usually, k is written in a positional numeral system. However, there exists a variety of numeral systems that can be used to represent numbers. Is it true that the prime factorization is (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  36
    Observability of Turing Machines: A Refinement of the Theory of Computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
    The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep investigation is performed on the interrelations between mechanical computations and their mathematical descriptions emerging when a human (the researcher) starts to describe a Turing machine (the object of the study) by (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  14.  35
    Numerical Point of View on Calculus for Functions Assuming Finite, Infinite, and Infinitesimal Values Over Finite, Infinite, and Infinitesimal Domains.Yaroslav Sergeyev - 2009 - Nonlinear Analysis Series A 71 (12):e1688-e1707.
    The goal of this paper consists of developing a new (more physical and numerical in comparison with standard and non-standard analysis approaches) point of view on Calculus with functions assuming infinite and infinitesimal values. It uses recently introduced infinite and infinitesimal numbers being in accordance with the principle ‘The part is less than the whole’ observed in the physical world around us. These numbers have a strong practical advantage with respect to traditional approaches: they are representable at a new kind (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   3 citations  
  15.  42
    Numerical Computations and Mathematical Modelling with Infinite and Infinitesimal Numbers.Yaroslav Sergeyev - 2009 - Journal of Applied Mathematics and Computing 29:177-195.
    Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not related to the non-standard analysis) is used to work with finite, infinite, and infinitesimal numbers numerically. This can be done on a new kind of a computer – the Infinity Computer – able to work with all these types of numbers. The new computational tools both give possibilities to (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  16.  31
    Evaluating the Exact Infinitesimal Values of Area of Sierpinski's Carpet and Volume of Menger's Sponge.Yaroslav Sergeyev - 2009 - Chaos, Solitons and Fractals 42: 3042–3046.
    Very often traditional approaches studying dynamics of self-similarity processes are not able to give their quantitative characteristics at infinity and, as a consequence, use limits to overcome this difficulty. For example, it is well know that the limit area of Sierpinski’s carpet and volume of Menger’s sponge are equal to zero. It is shown in this paper that recently introduced infinite and infinitesimal numbers allow us to use exact expressions instead of limits and to calculate exact infinitesimal values of areas (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  17.  36
    Counting Systems and the First Hilbert Problem.Yaroslav Sergeyev - 2010 - Nonlinear Analysis Series A 72 (3-4):1701-1708.
    The First Hilbert problem is studied in this paper by applying two instruments: a new methodology distinguishing between mathematical objects and mathematical languages used to describe these objects; and a new numeral system allowing one to express different infinite numbers and to use these numbers for measuring infinite sets. Several counting systems are taken into consideration. It is emphasized in the paper that different mathematical languages can describe mathematical objects (in particular, sets and the number of their elements) with different (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  18.  60
    Blinking Fractals and Their Quantitative Analysis Using Infinite and Infinitesimal Numbers.Yaroslav Sergeyev - 2007 - Chaos, Solitons and Fractals 33 (1):50-75.
    The paper considers a new type of objects – blinking fractals – that are not covered by traditional theories studying dynamics of self-similarity processes. It is shown that the new approach allows one to give various quantitative characteristics of the newly introduced and traditional fractals using infinite and infinitesimal numbers proposed recently. In this connection, the problem of the mathematical modelling of continuity is discussed in detail. A strong advantage of the introduced computational paradigm consists of its well-marked numerical character (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   4 citations  
  19.  30
    Lagrange Lecture: Methodology of Numerical Computations with Infinities and Infinitesimals.Yaroslav Sergeyev - 2010 - Rendiconti Del Seminario Matematico dell'Università E Del Politecnico di Torino 68 (2):95–113.
    A recently developed computational methodology for executing numerical calculations with infinities and infinitesimals is described in this paper. The approach developed has a pronounced applied character and is based on the principle “The part is less than the whole” introduced by the ancient Greeks. This principle is applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). The point of view on infinities and infinitesimals (and in general, on Mathematics) presented in this paper (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  20.  46
    Yaroslav Shramko and Heinrich Wansing, Truth and Falsehood - An Inquiry Into Generalized Logical Values.Jean-Yves Beziau - 2014 - Studia Logica 102 (5):1079-1085.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21. A Response to Yaroslav Senyshyn and Susan A. O'Neill," Subjective Experience of Anxiety and Musical Performance: A Relational Perspective".Stephen F. Zdzinski - forthcoming - Philosophy of Music Education Review.
     
    Export citation  
     
    Bookmark  
  22.  10
    Yaroslav the Wise in Norse Tradition.Samuel Hazzard Cross - 1929 - Speculum 4 (2):177-197.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  10
    Українські дипломатичні інституції в німеччині в 1918-1923 рр.Volodymyr Zabolotniuk - 2017 - Схід 6 (152):40-50.
    У статті розглядається становлення та діяльність у Німеччині українських посольств та консульських установ у 1918-1923 рр. У Берліні були представлені дипломатичні установи Української Народної Республіки доби Центральної Ради, Української Держави, Української Народної Республіки доби Директорії УНР. Своє посольство утворила в Берліні й Західно-Українська Народна Республіка. Але з огляду на можливу негативну реакцію країн Антанти посольство ЗУНР не розвинуло ширшої діяльності. Україна мала свої консульські установи в Берліні та Мюнхені. У статті згадується також про діяльність української консульської установи в Данцигу, який (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  24. Radiant Emptiness: Three Seminal Works by the Golden Pandita Shakya Chokden.Yaroslav Komarovski - 2020 - Oup Usa.
    In Luminous Emptiness, Yaroslav Komarovski offers an annotated translation of three seminal works on the nature and relationship of Yogacara and Madhyamaka, by Serdok Penchen Shakya Chokden.
     
    Export citation  
     
    Bookmark  
  25.  13
    Tibetan Buddhism and Mystical Experience.Yaroslav Komarovski - 2015 - Oxford University Press USA.
    In this book, Yaroslav Komarovski argues that the Tibetan Buddhist interpretations of the realization of ultimate reality both contribute to and challenge contemporary interpretations of unmediated mystical experience. The model used by the majority of Tibetan Buddhist thinkers states that the realization of ultimate reality, while unmediated during its actual occurrence, is necessarily filtered and mediated by the conditioning contemplative processes leading to it, and Komarovski argues that therefore, in order to understand this mystical experience, one must focus on (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26. Some Useful 16-Valued Logics: How a Computer Network Should Think.Yaroslav Shramko & Heinrich Wansing - 2005 - Journal of Philosophical Logic 34 (2):121-153.
    In Belnap's useful 4-valued logic, the set 2 = {T, F} of classical truth values is generalized to the set 4 = (2) = {Ø, {T}, {F}, {T, F}}. In the present paper, we argue in favor of extending this process to the set 16 = ᵍ (4) (and beyond). It turns out that this generalization is well-motivated and leads from the bilattice FOUR₂ with an information and a truth-and-falsity ordering to another algebraic structure, namely the trilattice SIXTEEN₃ with an (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   44 citations  
  27.  5
    Automated Proof-Searching for Strong Kleene Logic and its Binary Extensions Via Correspondence Analysis.Yaroslav Petrukhin & Vasilyi Shangin - forthcoming - Logic and Logical Philosophy:1.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  28.  73
    Hyper-Contradictions, Generalized Truth Values and Logics of Truth and Falsehood.Yaroslav Shramko & Heinrich Wansing - 2006 - Journal of Logic, Language and Information 15 (4):403-424.
    In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  29.  18
    Automated Correspondence Analysis for the Binary Extensions of the Logic of Paradox.Yaroslav Petrukhin & Vasily Shangin - 2017 - Review of Symbolic Logic 10 (4):756-781.
    B. Kooi and A. Tamminga present a correspondence analysis for extensions of G. Priest’s logic of paradox. Each unary or binary extension is characterizable by a special operator and analyzable via a sound and complete natural deduction system. The present paper develops a sound and complete proof searching technique for the binary extensions of the logic of paradox.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  30.  69
    Dual Intuitionistic Logic and a Variety of Negations: The Logic of Scientific Research.Yaroslav Shramko - 2005 - Studia Logica 80 (2-3):347-367.
    We consider a logic which is semantically dual (in some precise sense of the term) to intuitionistic. This logic can be labeled as “falsification logic”: it embodies the Popperian methodology of scientific discovery. Whereas intuitionistic logic deals with constructive truth and non-constructive falsity, and Nelson's logic takes both truth and falsity as constructive notions, in the falsification logic truth is essentially non-constructive as opposed to falsity that is conceived constructively. We also briefly clarify the relationships of our falsification logic to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  31. The Trilaticce of Constructive Truth Values.Yaroslav Shramko, J. Michael Dunn & Tatsutoshi Takenaka - 2001 - Journal of Logic and Computation 11 (1):761--788.
    Translate
     
     
    Export citation  
     
    Bookmark   27 citations  
  32.  17
    Kripke Completeness of Bi-Intuitionistic Multilattice Logic and its Connexive Variant.Norihiro Kamide, Yaroslav Shramko & Heinrich Wansing - 2017 - Studia Logica 105 (6):1193-1219.
    In this paper, bi-intuitionistic multilattice logic, which is a combination of multilattice logic and the bi-intuitionistic logic also known as Heyting–Brouwer logic, is introduced as a Gentzen-type sequent calculus. A Kripke semantics is developed for this logic, and the completeness theorem with respect to this semantics is proved via theorems for embedding this logic into bi-intuitionistic logic. The logic proposed is an extension of first-degree entailment logic and can be regarded as a bi-intuitionistic variant of the original classical multilattice logic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  33.  15
    Natural Deduction for Fitting’s Four-Valued Generalizations of Kleene’s Logics.Yaroslav I. Petrukhin - 2017 - Logica Universalis 11 (4):525-532.
    In this paper, we present sound and complete natural deduction systems for Fitting’s four-valued generalizations of Kleene’s three-valued regular logics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  34.  77
    Suszko’s Thesis, Inferential Many-Valuedness, and the Notion of a Logical System.Heinrich Wansing & Yaroslav Shramko - 2008 - Studia Logica 88 (3):405-429.
    According to Suszko's Thesis, there are but two logical values, true and false. In this paper, R. Suszko's, G. Malinowski's, and M. Tsuji's analyses of logical two-valuedness are critically discussed. Another analysis is presented, which favors a notion of a logical system as encompassing possibly more than one consequence relation.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  35.  30
    A Modal Translation for Dual-Intuitionistic Logic.Yaroslav Shramko - 2016 - Review of Symbolic Logic 9 (2):251-265.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  36.  10
    Natural Deduction for Post’s Logics and Their Duals.Yaroslav Petrukhin - 2018 - Logica Universalis 12 (1-2):83-100.
    In this paper, we introduce the notion of dual Post’s negation and an infinite class of Dual Post’s finitely-valued logics which differ from Post’s ones with respect to the definitions of negation and the sets of designated truth values. We present adequate natural deduction systems for all Post’s k-valued ) logics as well as for all Dual Post’s k-valued logics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37. What is a Genuine Intuitionistic Notion of Falsity?Yaroslav Shramko - 2012 - Logic and Logical Philosophy 21 (1):3-23.
    I highlight the importance of the notion of falsity for a semantical consideration of intuitionistic logic. One can find two principal (and non-equivalent) versions of such a notion in the literature, namely, falsity as non-truth and falsity as truth of a negative proposition. I argue in favor of the first version as the genuine intuitionistic notion of falsity.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38.  15
    First-Degree Entailment and its Relatives.Yaroslav Shramko, Dmitry Zaitsev & Alexander Belikov - 2017 - Studia Logica 105 (6):1291-1317.
    We consider a family of logical systems for representing entailment relations of various kinds. This family has its root in the logic of first-degree entailment formulated as a binary consequence system, i.e. a proof system dealing with the expressions of the form \, where both \ and \ are single formulas. We generalize this approach by constructing consequence systems that allow manipulating with sets of formulas, either to the right or left of the turnstile. In this way, it is possible (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  39.  12
    Modal Multilattice Logic.Norihiro Kamide & Yaroslav Shramko - 2017 - Logica Universalis 11 (3):317-343.
    A modal extension of multilattice logic, called modal multilattice logic, is introduced as a Gentzen-type sequent calculus \. Theorems for embedding \ into a Gentzen-type sequent calculus S4C and vice versa are proved. The cut-elimination theorem for \ is shown. A Kripke semantics for \ is introduced, and the completeness theorem with respect to this semantics is proved. Moreover, the duality principle is proved as a characteristic property of \.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  40.  13
    The Mathematical Intelligencer Flunks the Olympics.Alexander E. Gutman, Mikhail G. Katz, Taras S. Kudryk & Semen S. Kutateladze - 2017 - Foundations of Science 22 (3):539-555.
    The Mathematical Intelligencer recently published a note by Y. Sergeyev that challenges both mathematics and intelligence. We examine Sergeyev’s claims concerning his purported Infinity computer. We compare his grossone system with the classical Levi-Civita fields and with the hyperreal framework of A. Robinson, and analyze the related algorithmic issues inevitably arising in any genuine computer implementation. We show that Sergeyev’s grossone system is unnecessary and vague, and that whatever consistent subsystem could be salvaged is subsumed entirely within (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  41.  12
    Functional Completeness in CPL Via Correspondence Analysis.Dorota Leszczyńska-Jasion, Yaroslav Petrukhin, Vasilyi Shangin & Marcin Jukiewicz - 2019 - Bulletin of the Section of Logic 48 (1).
    Kooi and Tamminga's correspondence analysis is a technique for designing proof systems, mostly, natural deduction and sequent systems. In this paper it is used to generate sequent calculi with invertible rules, whose only branching rule is the rule of cut. The calculi pertain to classical propositional logic and any of its fragments that may be obtained from adding a set of rules characterizing a two-argument Boolean function to the negation fragment of classical propositional logic. The properties of soundness and completeness (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  13
    Exactly True and Non-Falsity Logics Meeting Infectious Ones.Alex Belikov & Yaroslav Petrukhin - 2020 - Journal of Applied Non-Classical Logics 30 (2):93-122.
    In this paper, we study logical systems which represent entailment relations of two kinds. We extend the approach of finding ‘exactly true’ and ‘non-falsity’ versions of four-valued logics that emerged in series of recent works [Pietz & Rivieccio (2013). Nothing but the truth. Journal of Philosophical Logic, 42(1), 125–135; Shramko (2019). Dual-Belnap logic and anything but falsehood. Journal of Logics and their Applications, 6, 413–433; Shramko et al. (2017). First-degree entailment and its relatives. Studia Logica, 105(6), 1291–1317] to the case (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  43.  2
    The Fmla-Fmla Axiomatizations of the Exactly True and Non-falsity Logics and Some of Their Cousins.Yaroslav Shramko, Dmitry Zaitsev & Alexander Belikov - 2019 - Journal of Philosophical Logic 48 (5):787-808.
    In this paper we present a solution of the axiomatization problem for the Fmla-Fmla versions of the Pietz and Rivieccio exactly true logic and the non-falsity logic dual to it. To prove the completeness of the corresponding binary consequence systems we introduce a specific proof-theoretic formalism, which allows us to deal simultaneously with two consequence relations within one logical system. These relations are hierarchically organized, so that one of them is treated as the basic for the resulting logic, and the (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  44.  9
    Two Proofs of the Algebraic Completeness Theorem for Multilattice Logic.Oleg Grigoriev & Yaroslav Petrukhin - 2019 - Journal of Applied Non-Classical Logics 29 (4):358-381.
    Shramko [. Truth, falsehood, information and beyond: The American plan generalized. In K. Bimbo, J. Michael Dunn on information based logics, outstanding contributions to logic...
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  6
    On a Multilattice Analogue of a Hypersequent S5 Calculus.Oleg Grigoriev & Yaroslav Petrukhin - forthcoming - Logic and Logical Philosophy:1.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  28
    Processing of Invisible Social Cues.M. Ida Gobbini, Jason D. Gors, Yaroslav O. Halchenko, Howard C. Hughes & Carlo Cipolli - 2013 - Consciousness and Cognition 22 (3):765-770.
    Successful interactions between people are dependent on rapid recognition of social cues. We investigated whether head direction – a powerful social signal – is processed in the absence of conscious awareness. We used continuous flash interocular suppression to render stimuli invisible and compared the reaction time for face detection when faces were turned towards the viewer and turned slightly away. We found that faces turned towards the viewer break through suppression faster than faces that are turned away, regardless of eye (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  47. The Slingshot Argument and Sentential Identity.Yaroslav Shramko & Heinrich Wansing - 2009 - Studia Logica 91 (3):429-455.
    The famous “slingshot argument” developed by Church, Gödel, Quine and Davidson is often considered to be a formally strict proof of the Fregean conception that all true sentences, as well as all false ones, have one and the same denotation, namely their corresponding truth value: the true or the false . In this paper we examine the analysis of the slingshot argument by means of a non-Fregean logic undertaken recently by A.Wóitowicz and put to the test her claim that the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  48.  11
    Rivals to Belnap–Dunn Logic on Interlaced Trilattices.Thomas Ferguson - 2017 - Studia Logica 105 (6):1123-1148.
    The work of Arnon Avron and Ofer Arieli has shown a deep relationship between the theory of bilattices and the Belnap-Dunn logic \. This correspondence has been interpreted as evidence that \ is “the” logic of bilattices, a consideration reinforced by the work of Yaroslav Shramko and Heinrich Wansing in which \ is shown to be similarly entrenched with respect to the theories of trilattices and, more generally, multilattices. In this paper, we export Melvin Fitting’s “cut-down” connectives—propositional connectives that (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  49.  40
    Truth Values.Yaroslav Shramko - 2010 - Stanford Encyclopedia of Philosophy.
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   6 citations  
  50.  27
    Bi-Facial Truth: A Case for Generalized Truth Values.Dmitry Zaitsev & Yaroslav Shramko - 2013 - Studia Logica 101 (6):1299-1318.
    We explore a possibility of generalization of classical truth values by distinguishing between their ontological and epistemic aspects and combining these aspects within a joint semantical framework. The outcome is four generalized classical truth values implemented by Cartesian product of two sets of classical truth values, where each generalized value comprises both ontological and epistemic components. This allows one to define two unary twin connectives that can be called “semi-classical negations”. Each of these negations deals only with one of the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
1 — 50 / 124