Results for 'Yaroslav Shramko'

37 found
Order:
  1. Символічна логіка: повернення до витоків. Стаття ІІІ. Похідні логістичні категорії.Yaroslav Kokhan - 2021 - Multiversum. Philosophical Almanac 2 (2):141-155.
    The paper is Part III of the large research, dedicated to both the revision of the system of basic logical categories and the generalization of modern predicate logic to functional logic. We determinate and contrapose modern Fregean logistics and proposed by the author ultra-Fregean logistics, next we describe values and arguments of functions, arguments of relations, relations themselves, sets (classes), and subsets (subclasses) as derivative categories (concepts) of ultrafregean logistics. Logistics is a part of metalogic, independent of semantics. Fregean logictics (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  2. (12 other versions)РЕКОНСТРУКЦІЯ КОРДОЦЕНТРИЧНОЇ ПАРАДИГМИ В УКРАЇНСЬКІЙ КЛАСИЧНІЙ ФІЛОСОФІЇ: ПОСТАНОВКА ПРОБЛЕМИ І ТЕРМІНОЛОГІЧНІ ПОЯСНЕННЯ.Yaroslav Hnatiuk - 2000 - Збірник Наукових Праць: Філософія, Соціологія, Психологія. – Івано-Франківськ: Вид-Во Andquot;Плай" Прикарпатського Ун-Ту 4 (1):207-215.
    Download  
     
    Export citation  
     
    Bookmark  
  3. Independence of the Grossone-Based Infinity Methodology from Non-standard Analysis and Comments upon Logical Fallacies in Some Texts Asserting the Opposite.Yaroslav D. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Natural Deduction for Three-Valued Regular Logics.Yaroslav Petrukhin - 2017 - Logic and Logical Philosophy 26 (2):197–206.
    In this paper, I consider a family of three-valued regular logics: the well-known strong and weak S.C. Kleene’s logics and two intermedi- ate logics, where one was discovered by M. Fitting and the other one by E. Komendantskaya. All these systems were originally presented in the semantical way and based on the theory of recursion. However, the proof theory of them still is not fully developed. Thus, natural deduction sys- tems are built only for strong Kleene’s logic both with one (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  5. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  6. THE HISTORICAL SYNTAX OF PHILOSOPHICAL LOGIC.Yaroslav Hnatiuk - 2022 - European Philosophical and Historical Discourse 8 (1):78-87.
    This article analyzes the historical development of the philosophical logic syntax from the standpoint of the unity of historical and logical methods. According to this perspective, there are three types of logical syntax: the elementary subject-predicate, the modified definitivespecificative, and the standard propositional-functional. These types are generalized in the grammatical and mathematical styles of logical syntax. The main attention is paid to two scientific revolutions in elementary subject-predicate syntax, which led to the emergence of modified definitive-specific and standard propositional-functional syntaxes (...)
    Download  
     
    Export citation  
     
    Bookmark  
  7. ANTHROPOLOGICAL SPECIFICS OF UKRAINIAN PHILOSOPHY IN THE PERSPECTIVE OF CULTURAL-PREDICATIVE ANALYSIS.Yaroslav Hnatiuk - 2022 - Ukrainian Studies 82 (1):92-105.
    The main purpose of the article is to analyze the statements of philosophical Ukrainian Studies about the anthropological specifics of Ukrainian philosophical thought by means of historicalphilosophical cultural-predicative analysis. The research methodology was determined primarily by the concept of cultural attribution and translation in the dialogue of languages of historical cultures of the Poznań Methodological School (J. Topolski, W. Wrzosek, E. Domańska) and the culturological approach in historical-philosophical Ukrainian Studies (V. Horskyi, S. Rudenko). The statements of the language of historical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. Силлогизм о добродетельных мудрецах.Yaroslav Slinin - 2018 - Schole 12 (1):63-71.
    The article deals with the Aristotelian doctrine of induction and its influence on the theory of induction of Al-Farabi. Inductive syllogisms of antiquity and the Middle Ages are compared with modern inferences by induction.
    Download  
     
    Export citation  
     
    Bookmark  
  9. 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. (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  10. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  11. (1 other version)УКРАЇНСЬКИЙ КОРДОЦЕНТРИЗМ У КОНФЛІКТІ МІФОЛОГІЙ ТА ІНТЕРПРЕТАЦІЙ.Yaroslav Hnatiuk (ed.) - 2010 - Івано-Франківськ, Івано-Франківська область, Україна, 76000:
    Українська академічна спільнота, незважаючи на значний теоретичний масив інформації, й далі перебуває у полоні ілюзій, шаблонів сприйняття та некоректних тлумачень концепта «український кордоцентризм». Філософська дискусія навколо цього концепта є конфліктом міфологій – протистоянням між міфом про унікальний етноментальний феномен та міфом про ілюзію наукової уяви. Водночас вона є конфліктом інтерпретацій – протистоянням між міфічною інтерпретацією класичної доби української філософії та її метафілософською інтерпретацією. Пропонована монографія ознайомлює із філософською позицією автора концепта «український кордоцентризм», його оцінкою цих конфліктів.
    Download  
     
    Export citation  
     
    Bookmark  
  12. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  13. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  14. UN SEMPLICE MODO PER TRATTARE LE GRANDEZZE INFINITE ED INFINITESIME.Yaroslav Sergeyev - 2015 - la Matematica Nella Società E Nella Cultura: Rivista Dell’Unione Matematica Italiana, Serie I 8:111-147.
    A new computational methodology allowing one to work in a new way with infinities and infinitesimals is presented in this paper. The new approach, among other things, gives the possibility to calculate the number of elements of certain infinite sets, avoids indeterminate forms and various kinds of divergences. This methodology has been used by the author as a starting point in developing a new kind of computer – the Infinity Computer – able to execute computations and to store in its (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  15. Lower and Upper Estimates of the Quantity of Algebraic Numbers.Yaroslav Sergeyev - 2023 - Mediterranian Journal of Mathematics 20:12.
    It is well known that the set of algebraic numbers (let us call it A) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using ①-based infinite numbers is applied to measure the set A (where the number ① is called grossone). Our interest to this methodology is explained by the fact that in certain cases where cardinals allow one to say only whether a set is countable (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  17. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  18. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  19. Numerical infinities applied for studying Riemann series theorem and Ramanujan summation.Yaroslav Sergeyev - 2018 - In AIP Conference Proceedings 1978. AIP. pp. 020004.
    A computational methodology called Grossone Infinity Computing introduced with the intention to allow one to work with infinities and infinitesimals numerically has been applied recently to a number of problems in numerical mathematics (optimization, numerical differentiation, numerical algorithms for solving ODEs, etc.). The possibility to use a specially developed computational device called the Infinity Computer (patented in USA and EU) for working with infinite and infinitesimal numbers numerically gives an additional advantage to this approach in comparison with traditional methodologies studying (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  20. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  21. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  22. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  23. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  24. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  25. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  26. Numerical methods for solving initial value problems on the Infinity Computer.Yaroslav Sergeyev, Marat Mukhametzhanov, Francesca Mazzia, Felice Iavernaro & Pierluigi Amodio - 2016 - International Journal of Unconventional Computing 12 (1):3-23.
    New algorithms for the numerical solution of Ordinary Differential Equations (ODEs) with initial condition are proposed. They are designed for work on a new kind of a supercomputer – the Infinity Computer, – that is able to deal numerically with finite, infinite and infinitesimal numbers. Due to this fact, the Infinity Computer allows one to calculate the exact derivatives of functions using infinitesimal values of the stepsize. As a consequence, the new methods described in this paper are able to work (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  27. Some paradoxes of infinity revisited.Yaroslav Sergeyev - 2022 - Mediterranian Journal of Mathematics 19:143.
    In this article, some classical paradoxes of infinity such as Galileo’s paradox, Hilbert’s paradox of the Grand Hotel, Thomson’s lamp paradox, and the rectangle paradox of Torricelli are considered. In addition, three paradoxes regarding divergent series and a new paradox dealing with multiplication of elements of an infinite set are also described. It is shown that the surprising counting system of an Amazonian tribe, Pirah ̃a, working with only three numerals (one, two, many) can help us to change our perception (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  29. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  31. Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm.Marco Cococcioni, Massimo Pappalardo & Yaroslav Sergeyev - 2018 - Applied Mathematics and Computation 318:298-311.
    Numerous problems arising in engineering applications can have several objectives to be satisfied. An important class of problems of this kind is lexicographic multi-objective problems where the first objective is incomparably more important than the second one which, in its turn, is incomparably more important than the third one, etc. In this paper, Lexicographic Multi-Objective Linear Programming (LMOLP) problems are considered. To tackle them, traditional approaches either require solution of a series of linear programming problems or apply a scalarization of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  32. Computation of higher order Lie derivatives on the Infinity Computer.Felice Iavernaro, Francesca Mazzia, Marat Mukhametzhanov & Yaroslav Sergeyev - 2021 - Journal of Computational and Applied Mathematics 383:113135.
    In this paper, we deal with the computation of Lie derivatives, which are required, for example, in some numerical methods for the solution of differential equations. One common way for computing them is to use symbolic computation. Computer algebra software, however, might fail if the function is complicated, and cannot be even performed if an explicit formulation of the function is not available, but we have only an algorithm for its computation. An alternative way to address the problem is to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  33. Current issues of security management during martial law.Maksym Bezpartochnyi, Igor Britchenko, Olesia Bezpartochna, Kostyantyn Afanasyev, Mariia Bahorka, Oksana Bezsmertna, Olena Borschevska, Liliana Chyshynska-Hlybovych, Anna Dybała, Darya Gurova, Iryna Hanechko, Petro Havrylko, Olha Hromova, Tetiana Hushtan, Iryna Kadyrus, Yuri Kindzerski, Svіtlana Kirian, Anatoliy Kolodiychuk, Oleksandr Kovalenko, Andrii Krupskyi, Serhii Leontovych, Olena Lytvyn, Denys Mykhailyk, Oleh Nyzhnyk, Hanna Oleksyuk, Nataliia Petryshyn, Olha Podra, Nazariy Popadynets, Halyna Pushak, Yaroslav Pushak, Oksana Radchenko, Olha Ryndzak, Nataliia Semenyshena, Vitalii Sharko, Vladimir Shedyakov, Olena Stanislavyk, Dmytro Strikhovskyi, Oksana Trubei, Nataliia Trushkina, Sergiy Tsviliy, Leonid Tulush, Liudmyla Vahanova, Nataliy Yurchenko, Andrij Zaverbnyj & Svitlana Zhuravlova (eds.) - 2022 - Vysoká škola bezpečnostného manažérstva v Košiciach.
    The authors of the book have come to the conclusion that toensuring the country’s security in the conditions of military aggression, it is necessary to use the mechanisms of protection of territories and population, support of economic entities, international legal levers of influence on the aggressor country. Basic research focuses on assessment the resource potential of enterprises during martial law, the analysis of migration flows in the middle of the country and abroad, the volume of food exports, marketing and logistics (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. The Bulletin of Yaroslav Mudryi National Law University. Series: philosophy, philosophy of law, political science, sociology. Trebin, Blikhar & Trebin Mykhailo Petrovych - 2022 - The Bulletin of Yaroslav Mudryi National Law University. Series: Philosophy, Philosophy of Law, Political Science, Sociology : The Collection of Scientific Papers 240:204-217.
    The article examines the peculiarities of state-church relations that are formed in the process of legitimizing civil society. It is substantiated that the 21st century, like the last 20th century, forces us to search for a new format of state-church relations in the context of international relations, modern globalization challenges, and the development of the latest communication and information space. This, of course, prompts a new assessment of the status of religion and the church in the modern political system and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. From Bi-facial Truth to Bi-facial Proofs.Stefan Wintein & Reinhard A. Muskens - 2015 - Studia Logica 103 (3):545-558.
    In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological and an epistemic interpretation of classical truth values. By taking the Cartesian product of the two disjoint sets of values thus obtained, they arrive at four generalized truth values and consider two “semi-classical negations” on them. The resulting semantics is used to define three novel logics which are closely related to Belnap’s well-known four valued logic. A syntactic characterization of (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  36. Analytic Tableaux for all of SIXTEEN 3.Stefan Wintein & Reinhard Muskens - 2015 - Journal of Philosophical Logic 44 (5):473-487.
    In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first three (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  37. Interpolation in 16-Valued Trilattice Logics.Reinhard Muskens & Stefan Wintein - 2018 - Studia Logica 106 (2):345-370.
    In a recent paper we have defined an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing's logic based on the trilattice SIXTEEN_3. This calculus makes it possible to define syntactic entailment relations that capture central semantic relations of the logic---such as the relations |=_t, |=_f, and |=_i that each correspond to a lattice order in SIXTEEN_3; and |=, the intersection of |=_t and |=_f,. -/- It turns out that our method of characterising these semantic (...)
    Download  
     
    Export citation  
     
    Bookmark