-
Data dimensionality reduction for an optimal switching mode classification applied to a step-down power converter Log. J. IGPL (IF 1.0) Pub Date : 2024-04-06 Luis-Alfonso Fernandez-Serantes, José-Luis Casteleiro-Roca, Hubert Berger, Dragan Simić, José-Luis Calvo-Rolle
A dimensional reduction algorithm is applied to an intelligent classification model with the purpose of improving the efficiency and accuracy. The proposed classification model, used to distinguish the operating mode: Hard- and Soft-Switching, is presented and an analysis of the synchronized rectified step-down converter is done. With the aim of improving the accuracy and reducing the computational
-
Gaussian process-based analysis of the nitrogen dioxide at Madrid Central Low Emission Zone Log. J. IGPL (IF 1.0) Pub Date : 2024-04-06 Juan Luis Gómez-González, Miguel Cárdenas-Montes
Concern about air-quality in urban areas has led to the implementation of Low Emission Zones as one of many other initiatives to control it. Recently in Spain, the enactment of a law made this mandatory for cities with a population larger than 50k inhabitants. The delimitation of these areas is not without controversy because of possible negative economic and social impacts. Therefore, clear assessments
-
PhrasIS: Phrase Inference and Similarity benchmark Log. J. IGPL (IF 1.0) Pub Date : 2024-04-06 I Lopez-Gazpio, J Gaviria, P García, H Sanjurjo-González, B Sanz, A Zarranz, M Maritxalar, E Agirre
We present PhrasIS, a benchmark dataset composed of natural occurring Phrase pairs with Inference and Similarity annotations for the evaluation of semantic representations. The described dataset fills the gap between word and sentence-level datasets, allowing to evaluate compositional models at a finer granularity than sentences. Contrary to other datasets, the phrase pairs are extracted from naturally
-
Machine learning for electric energy consumption forecasting: Application to the Paraguayan system Log. J. IGPL (IF 1.0) Pub Date : 2024-04-06 Félix Morales-Mareco, Miguel García-Torres, Federico Divina, Diego H Stalder, Carlos Sauer
In this paper we address the problem of short-term electric energy prediction using a time series forecasting approach applied to data generated by a Paraguayan electricity distribution provider. The dataset used in this work contains data collected over a three-year period. This is the first time that these data have been used; therefore, a preprocessing phase of the data was also performed. In particular
-
On split-octonionic curves Log. J. IGPL (IF 1.0) Pub Date : 2024-03-28 Jeta Alo, MÜcahit Akbiyik
In this paper, we first define the vector product in Minkowski space $\mathbb{R}_{4}^{7}$, which is identified with the space of spatial split-octonions. Next, we derive the $G_{2}-$ frame formulae for a seven dimensional Minkowski curve by using the spatial split-octonions and the vector product. We show that Frenet–Serret formulas are satisfied for a spatial split octonionic curve. We obtain the
-
Black widow optimization for reducing the target uncertainties in localization wireless sensor networks Log. J. IGPL (IF 1.0) Pub Date : 2024-03-27 Rubén Ferrero-Guillén, José-Manuel Alija-Pérez, Alberto Martínez-Gutiérrez, Rubén Álvarez, Paula Verde, Javier Díez-González
Localization Wireless Sensor Networks (WSN) represent a research topic with increasing interest due to their numerous applications. However, the viability of these systems is compromised by the attained localization uncertainties once implemented, since the network performance is highly dependent on the sensors location. The Node Location Problem (NLP) aims to obtain the optimal distribution of sensors
-
Recurrent variational autoencoder approach for remaining useful life estimation Log. J. IGPL (IF 1.0) Pub Date : 2024-03-27 Nahuel Costa, Luciano Sánchez
A new method for evaluating aircraft engine monitoring data is proposed. Commonly, prognostics and health management systems use knowledge of the degradation processes of certain engine components together with professional expert opinion to predict the Remaining Useful Life (RUL). New data-driven approaches have emerged to provide accurate diagnostics without relying on such costly processes. However
-
A novel memetic algorithm for solving the generalized traveling salesman problem Log. J. IGPL (IF 1.0) Pub Date : 2024-03-27 Ovidiu Cosma, Petrică C Pop, Laura Cosma
This paper investigates the Generalized Traveling Salesman Problem (GTSP), which is an extension of the well-known Traveling Salesman Problem (TSP), and it searches for an optimal tour in a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a novel Memetic Algorithm (MA) for solving efficiently the GTSP. Our proposed MA has at its core a genetic algorithm (GA)
-
Predictive maintenance of vehicle fleets through hybrid deep learning-based ensemble methods for industrial IoT datasets Log. J. IGPL (IF 1.0) Pub Date : 2024-03-27 Arindam Chaudhuri, Soumya K Ghosh
Connected vehicle fleets have formed significant component of industrial internet of things scenarios as part of Industry 4.0 worldwide. The number of vehicles in these fleets has grown at a steady pace. The vehicles monitoring with machine learning algorithms has significantly improved maintenance activities. Predictive maintenance potential has increased where machines are controlled through networked
-
A variable neighbourhood search for minimization of operation times through warehouse layout optimization Log. J. IGPL (IF 1.0) Pub Date : 2024-03-27 Jon Díaz, Haizea Rodriguez, Jenny Fajardo-Calderín, Ignacio Angulo, Enrique Onieva
For companies involved in the supply chain, proper warehousing management is crucial. Warehouse layout arrangement and operation play a critical role in a company’s ability to maintain and improve its competitiveness. Reducing costs and increasing efficiency are two of the most crucial warehousing goals. Deciding on the best warehouse layout is a remarkable optimization problem. This paper uses an
-
An innovative framework for supporting content-based authorship identification and analysis in social media networks Log. J. IGPL (IF 1.0) Pub Date : 2024-03-26 José Gaviria de la Puerta, Iker Pastor-López, Alberto Tellaeche, Borja Sanz, Hugo Sanjurjo-González, Alfredo Cuzzocrea, Pablo G Bringas
Content-based authorship identification is an emerging research problem in online social media networks, due to a wide collection of issues ranging from security to privacy preservation, from radicalization to defamation detection, and so forth. Indeed, this research has attracted a relevant amount of attention from the research community during the past years. The general problem becomes harder when
-
LSTM vs CNN in real ship trajectory classification Log. J. IGPL (IF 1.0) Pub Date : 2024-03-26 Juan Pedro Llerena, Jesús García, José Manuel Molina
Ship-type identification in a maritime context can be critical to the authorities to control the activities being carried out. Although Automatic Identification Systems has been mandatory for certain vessels, if a vessel does not have them voluntarily or not, it can lead to a whole set of problems, which is why the use of tracking alternatives such as radar is fully complementary for a vessel monitoring
-
Tabu search and genetic algorithm in rims production process assignment Log. J. IGPL (IF 1.0) Pub Date : 2024-03-26 Anna Burduk, Grzegorz Bocewicz, Łukasz Łampika, Dagmara Łapczyńska, Kamil Musiał
The paper discusses the problem of assignment production resources in executing a production order on the example of the car rims manufacturing process. The more resources are involved in implementing the manufacturing process and the more they can be used interchangeably, the more complex and problematic the scheduling process becomes. Special attention is paid to the effective scheduling and assignment
-
AGV fuzzy control optimized by genetic algorithms Log. J. IGPL (IF 1.0) Pub Date : 2024-03-24 J Enrique Sierra-Garcia, Matilde Santos
Automated Guided Vehicles (AGV) are an essential element of transport in industry 4.0. Although they may seem simple systems in terms of their kinematics, their dynamics is very complex, and it requires robust and efficient controllers for their routes in the workspaces. In this paper, we present the design and implementation of an intelligent controller of a hybrid AGV based on fuzzy logic. In addition
-
Adaptive graph Laplacian MTL L1, L2 and LS-SVMs Log. J. IGPL (IF 1.0) Pub Date : 2024-03-24 Carlos Ruiz, Carlos M Alaíz, José R Dorronsoro
Multi-Task Learning tries to improve the learning process of different tasks by solving them simultaneously. A popular Multi-Task Learning formulation for SVM is to combine common and task-specific parts. Other approaches rely on using a Graph Laplacian regularizer. Here we propose a combination of these two approaches that can be applied to L1, L2 and LS-SVMs. We also propose an algorithm to iteratively
-
A comparison of time series lags and non-lags in Spanish electricity price forecasting using data science models Log. J. IGPL (IF 1.0) Pub Date : 2024-03-24 Belén Vega-Márquez, Javier Solís-García, Isabel A Nepomuceno-Chamorro, Cristina Rubio-Escudero
Electricity is an indicator that shows the progress of a civilization; it is a product that has greatly changed the way we think about the world. Electricity price forecasting became a fundamental task in all countries due to the deregulation of the electricity market in the 1990s. This work examines the effectiveness of using multiple variables for price prediction given the large number of factors
-
Beta Hebbian Learning for intrusion detection in networks with MQTT Protocols for IoT devices Log. J. IGPL (IF 1.0) Pub Date : 2024-03-22 Álvaro Michelena, María Teresa García Ordás, José Aveleira-Mata, David Yeregui Marcos del Blanco, Míriam Timiraos Díaz, Francisco Zayas-Gato, Esteban Jove, José-Luis Casteleiro-Roca, Héctor Quintián, Héctor Alaiz-Moretón, José Luis Calvo-Rolle
This paper aims to enhance security in IoT device networks through a visual tool that utilizes three projection techniques, including Beta Hebbian Learning (BHL), t-distributed Stochastic Neighbor Embedding (t-SNE) and ISOMAP, in order to facilitate the identification of network attacks by human experts. This work research begins with the creation of a testing environment with IoT devices and web clients
-
Realtime polymorphic malicious behavior detection in blockchain-based smart contracts Log. J. IGPL (IF 1.0) Pub Date : 2024-03-20 Darius Galiş, Ciprian Pungilă, Viorel Negru
This paper proposes an innovative approach to achieving real-time polymorphic behavior detection, and its direct application to blockchain-focused smart-contracts. We devise a method based on a non-deterministic finite state machine to perform approximate pattern-matching, using a look-ahead mechanism implemented through a concept similar to that of a sliding window, and using threshold-based similarity
-
Some results for min matrices associated with Chebyshev polynomials Log. J. IGPL (IF 1.0) Pub Date : 2024-03-20 Fatih Yilmaz, Samet Arpaci, Aybüke Ertaş
In the present study, inspired by the studies in the literature, we consider Min matrix and its Hadamard exponential matrix family whose elements are Chebyshev polynomials of the first kind. Afterwards, we examine their various linear algebraic properties and obtain some inequalities. Furthermore, we shed light on the results we obtained to boost the clarity of our paper with the illustrative examples
-
Towards enhanced monitoring framework with smart predictions Log. J. IGPL (IF 1.0) Pub Date : 2024-03-16 Antonello Calabrò, Said Daoudagh, Eda Marchetti
Context: Predicting security and trust vulnerabilities and issues is crucial for IoT interconnected systems and ecosystems, especially when integrating new, third-party or open-source components. Objective: One way to ensure timely predictions is by using a smart monitoring framework to continuously verify functional and non-functional property violations during the executions of the systems and their
-
Detection, exploitation and mitigation of memory errors Log. J. IGPL (IF 1.0) Pub Date : 2024-03-16 Oscar Llorente-Vazquez, Igor Santos-Grueiro, Iker Pastor-Lopez, Pablo Garcia Bringas
Software vulnerabilities are the root cause for a multitude of security problems in computer systems. Owing to their efficiency and tight control over low-level system resources, the C and C++ programming languages are extensively used for a myriad of purposes, from implementing operating system kernels to user-space applications. However, insufficient or improper memory management frequently leads
-
Exploiting multimodal biometrics for enhancing password security Log. J. IGPL (IF 1.0) Pub Date : 2024-03-16 Konstantinos Karampidis
Digitization of every daily procedure requires trustworthy verification schemes. People tend to overlook the security of the passwords they use, i.e. they use the same password on different occasions, they neglect to change them periodically or they often forget them. This raises a major security issue, especially for elderly people who are not familiar with modern technology and its risks and challenges
-
Good practices in designing a communication channel architecture for secure async flexible distributed collaboration Log. J. IGPL (IF 1.0) Pub Date : 2024-03-15 Rudolf Erdei, Daniela Delinschi, Oliviu Matei, Laura Andreica
In this paper we present a set of good practices in the design of a security-centric architecture for a Communication Channel that can be used to secure a Loosely-Coupled distributed platform, over unreliable communication mediums. The proposed practices are derived from designing a complete architecture that is modular and designed to support principles of Service Oriented Architecture (SOA) and the
-
Symmetric and conflated intuitionistic logics Log. J. IGPL (IF 1.0) Pub Date : 2024-03-04 Norihiro Kamide
Two new propositional non-classical logics, referred to as symmetric intuitionistic logic (SIL) and conflated intuitionistic logic (CIL), are introduced as indexed and non-indexed Gentzen-style sequent calculi. SIL is regarded as a natural hybrid logic combining intuitionistic and dual-intuitionistic logics, whereas CIL is regarded as a variant of intuitionistic paraconsistent logic with conflation
-
Base-extension semantics for modal logic Log. J. IGPL (IF 1.0) Pub Date : 2024-03-02 Timo Eckhardt, David J Pym
In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional
-
A characterization of crossed self-similarity on crossed modules in L-algebras Log. J. IGPL (IF 1.0) Pub Date : 2024-02-29 Selim Çetin, Utku Gürdal
We introduce crossed modules in cycloids, as a generalization of cycloids, which are algebraic logical structures arising in the context of the quantum Yang–Baxter equation. As a spacial case, we in particular focus on the crossed modules of $L-$algebras. These types of crossed modules are exceptional, since the category of $L-$algebras is not protomodular, nor Barr-exact, but it nevertheless has natural
-
Labelled proof systems for existential reasoning Log. J. IGPL (IF 1.0) Pub Date : 2024-01-30 Jaime Ramos, João Rasga, Cristina Sernadas
Usually in logic, proof systems are defined having in mind proving properties like validity and semantic consequence. It seems worthwhile to address the problem of having proof systems where satisfiability is a primitive notion in the sense that a formal derivation means that a finite set of formulas is satisfiable. Moreover, it would be useful to cover within the same framework as many logics as possible
-
Constructive theories through a modal lens Log. J. IGPL (IF 1.0) Pub Date : 2023-12-30 Matteo Tesi
We present a uniform proof-theoretic proof of the Gödel–McKinsey–Tarski embedding for a class of first-order intuitionistic theories. This is achieved by adapting to the case of modal logic the methods of proof analysis in order to convert axioms into rules of inference of a suitable sequent calculus. The soundness and the faithfulness of the embedding are proved by induction on the height of the derivations
-
On the number of different variables required to define the n-density or the bounded n-width of Kripke frames with some consequences for Sahlqvist formulae Log. J. IGPL (IF 1.0) Pub Date : 2023-11-20 Petar Iliev
We show that both the $n$-density and the bounded $n$-width of Kripke frames can be modally defined not only with natural and well-known Sahlqvist formulae containing a linear number of different propositional variables but also with formulae of polynomial length with a logarithmic number of different propositional variables and then we prove that this exponential decrease in the number of variables
-
The use of logic and argumentation in therapy of sex offenders Log. J. IGPL (IF 1.0) Pub Date : 2023-10-19 Dov Gabbay, Gadi Rozenberg, Lydia Rivlin
This paper is intended first for the formal argumentation community (see https://comma.csc.liv.ac.uk/). This community develops logics and systems modelling argumentation and dialogues. The community is in search of major applications areas for their models. One such application area e.g. is Law. The message of this paper is that there is another major application area for formal argumentation. There
-
Algebraic structures formalizing the logic with unsharp implication and negation Log. J. IGPL (IF 1.0) Pub Date : 2023-10-19 Ivan Chajda, Helmut Länger
It is well-known that intuitionistic logics can be formalized by means of Heyting algebras, i.e. relatively pseudocomplemented semilattices. Within such algebras the logical connectives implication and conjunction are formalized as the relative pseudocomplement and the semilattice operation meet, respectively. If the Heyting algebra has a bottom element $0$, then the relative pseudocomplement with
-
Report on the exact methods for finding minimum-sized DFA Log. J. IGPL (IF 1.0) Pub Date : 2023-09-09 Wojciech Wieczorek, Łukasz Strąk, Arkadiusz Nowakowski
This paper presents four state-of-art methods for the finite-state automaton inference based on a sample of labeled strings. The first algorithm is Exbar, and the next three are mathematical models based on ASP, SAT and SMT theories. The potentiality of using multiprocessor computers in the context of automata inference was our research’s primary goal. In a series of experiments, we showed that our
-
The fixed points of belief and knowledge Log. J. IGPL (IF 1.0) Pub Date : 2023-09-06 Daniela Schuster
Self-referential sentences have troubled our understanding of language for centuries. The most famous self-referential sentence is probably the Liar, a sentence that says of itself that it is false. The Liar Paradox has encouraged many philosophers to establish theories of truth that manage to give a proper account of the truth predicate in a formal language. Kripke’s Fixed Point Theory from 1975 is
-
On the relationships between some meta-mathematical properties of arithmetical theories Log. J. IGPL (IF 1.0) Pub Date : 2023-09-06 Yong Cheng
In this work, we aim at understanding incompleteness in an abstract way via metamathematical properties of formal theories. We systematically examine the relationships between the following twelve important metamathematical properties of arithmetical theories: Rosser, EI (effectively inseparable), RI (recursively inseparable), TP (Turing persistent), EHU (essentially hereditarily undecidable), EU (essentially
-
A probabilistic temporal epistemic logic: Decidability Log. J. IGPL (IF 1.0) Pub Date : 2023-09-04 Zoran Ognjanović, Angelina Ilić Stepić, Aleksandar Perović
We study a propositional probabilistic temporal epistemic logic $\textbf {PTEL}$ with both future and past temporal operators, with non-rigid set of agents and the operators for agents’ knowledge and for common knowledge and with probabilities defined on the sets of runs and on the sets of possible worlds. A semantics is given by a class ${\scriptsize{\rm Mod}}$ of Kripke-like models with possible
-
Semantical investigations on non-classical logics with recovery operators: negation Log. J. IGPL (IF 1.0) Pub Date : 2023-08-31 David Fuenmayor
We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to ‘recover’ the properties of classical logic in a controlled manner. These structures are known as topological Boolean algebras, which are Boolean algebras extended with additional operations subject
-
Logical reduction of relations: From relational databases to Peirce’s reduction thesis Log. J. IGPL (IF 1.0) Pub Date : 2023-06-10 Sergiy Koshkin
We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra
-
Remarks on uniform interpolation property Log. J. IGPL (IF 1.0) Pub Date : 2023-06-08 Majid Alizadeh
A logic $\mathcal{L}$ is said to satisfy the descending chain condition, DCC, if any descending chain of formulas in $\mathcal{L}$ with ordering induced by $\vdash _{\mathcal{L}};$ eventually stops. In this short note, we first establish a general theorem, which states that if a propositional logic $\mathcal{L}$ satisfies both DCC and has the Craig Interpolation Property, CIP, then it satisfies the
-
Logics and collaboration Log. J. IGPL (IF 1.0) Pub Date : 2023-05-08 Liz Sonenberg
Since the early days of artificial intelligence (AI), many logics have been explored as tools for knowledge representation and reasoning. In the spirit of the Crossley Festscrift and recognizing John Crossley’s diverse interests and his legacy in both mathematical logic and computer science, I discuss examples from my own research that sit in the overlap of logic and AI, with a focus on supporting
-
Proof-carrying parameters in certified symbolic execution Log. J. IGPL (IF 1.0) Pub Date : 2023-05-03 Andrei Arusoaie, Dorel Lucanu
Complex frameworks for defining programming languages aim to generate various tools (e.g. interpreters, symbolic execution engines, deductive verifiers, etc.) using only the formal definition of a language. When used at an industrial scale, these tools are constantly updated, and at the same time, it is required to be trustworthy. Ensuring the correctness of such a framework is practically impossible
-
Algebraic logic for the negation fragment of classical logic Log. J. IGPL (IF 1.0) Pub Date : 2023-04-28 Luciano J González
The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary () Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically associated with a logic in Algebraic Logic, i.e. we find the classes $\textrm{Alg}^*$, $\textrm{Alg}$ and the intrinsic variety of the negation fragment of classical logic. In order
-
Correspondence and canonicity theory of quasi-inequalities andΠ2-statements in modal subordination algebras Log. J. IGPL (IF 1.0) Pub Date : 2023-03-18 Zhiguang Zhao
In the present paper, we study the correspondence and canonicity theory of modal subordination algebras and their dual Stone space with two relations, generalizing correspondence results for subordination algebras in [13–15, 25]. Due to the fact that the language of modal subordination algebras involves a binary subordination relation, we will find it convenient to use the so-called quasi-inequalities
-
Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness Log. J. IGPL (IF 1.0) Pub Date : 2023-03-01 Mikhail Rybakov
In this paper, the predicate counterparts, defined both axiomatically and semantically by means of Kripke frames, of the modal propositional logics $\textbf {GL}$, $\textbf {Grz}$, $\textbf {wGrz}$ and their extensions are considered. It is proved that the set of semantical consequences on Kripke frames of every logic between $\textbf {QwGrz}$ and $\textbf {QGL.3}$ or between $\textbf {QwGrz}$ and
-
Logic, Co-ordination and the Envelope of our Beliefs Log. J. IGPL (IF 1.0) Pub Date : 2022-12-14 Rohit Parikh
Each of us has a story which we can think of as a set of beliefs, hopefully consistent. We make our decisions in view of our beliefs which may be probabilistic, in the general case, but simple yes or no as in this paper. Our beliefs are our envelope just as the shell of a tortoise is its envelope. Decision theory—or single agent game theory tells us when to make the best choice in a game of us against
-
Amalgamation and Robinson property in universal algebraic logic Log. J. IGPL (IF 1.0) Pub Date : 2022-11-25 Zalán Gyenis, Övge Öztürk
There is a well-established correspondence between interpolation and amalgamation for algebraizable logics that satisfy certain additional assumptions. In this paper, we introduce the Robinson property of a logic and show that a conditionally algebraizable logic without any additional assumptions has the Robinson property if and only if the corresponding class of Lindenbaum–Tarski algebras has the
-
On algebraic and topological semantics of the modal logic of common knowledge S4CI Log. J. IGPL (IF 1.0) Pub Date : 2022-11-25 Daniyar Shamkanov
For the modal logic $\textsf {S4}^{C}_{I}$, we identify the class of completable $\textsf {S4}^{C}_{I}$-algebras and prove for them a Stone-type representation theorem. As a consequence, we obtain strong algebraic and topological completeness of the logic $\textsf {S4}^{C}_{I}$ in the case of local semantic consequence relations. In addition, we consider an extension of the logic $\textsf {S4}^{C}_{I}$
-
The Spectra of Quasi-Boolean Algebras Log. J. IGPL (IF 1.0) Pub Date : 2022-11-08 Yajie Lv, Wenjuan Chen
In the present paper, we introduce the notions of quasi-Boolean algebras as the generalization of Boolean algebras. First we discuss the related properties of quasi-Boolean algebras. Second we define filters of quasi-Boolean algebras and investigate some properties of filters in quasi-Boolean algebras. We also show that there is a one-to-one correspondence between the set of filters and the set of
-
Contrariety Re-encountered: Nonstandard Contraries and Internal Negation** Log. J. IGPL (IF 1.0) Pub Date : 2022-10-18 Lloyd Humberstone
This discussion explores the possibility of distinguishing a tighter notion of contrariety evident in the Square of Opposition, especially in its modal incarnations, than as that binary relation holding statements that cannot both be true, with or without the added rider ‘though can both be false’. More than one theorist has voiced the intuition that the paradigmatic contraries of the traditional Square
-
Paraconsistentization and many-valued logics Log. J. IGPL (IF 1.0) Pub Date : 2022-10-14 Edelcio G de Souza, Alexandre Costa-Leite, Diogo H B Dias
This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate mainly the case of three-valued systems exhibiting how non-explosive three-valued logics can be obtained from them.
-
The Logic of Conditionals on Outback Trails Log. J. IGPL (IF 1.0) Pub Date : 2022-10-13 Johan van Benthem
Conditional statements are ubiquitous, from promises and threats to reasoning and decision making. By now, logicians have studied them from many different angles, both semantic and proof-theoretic. This paper suggests two more perspectives on the meaning of conditionals, one dynamic and one geometric, that may throw yet more light on a familiar and yet in some ways surprisingly elusive and many-faceted
-
The Logic Languages of the TPTP World Log. J. IGPL (IF 1.0) Pub Date : 2022-09-13 Geoff Sutcliffe
The Thousands of Problems for Theorem Provers (TPTP) World is a well-established infrastructure that supports research, development and deployment of automated theorem proving systems. This paper provides an overview of the logic languages of the TPTP World, from classical first-order form (FOF), through typed FOF, up to typed higher-order form, and beyond to non-classical forms. The logic languages
-
Kolmogorov and Kuroda Translations Into Basic Predicate Logic Log. J. IGPL (IF 1.0) Pub Date : 2022-09-05 Mohammad Ardeshir, Wim Ruitenburg
Kolmogorov established the principle of the double negation translation by which to embed Classical Predicate Logic ${\operatorname {CQC}}$ into Intuitionistic Predicate Logic ${\operatorname {IQC}}$. We show that the obvious generalizations to the Basic Predicate Logic of [3] and to ${\operatorname {BQC}}$ of [12], a proper subsystem of ${\operatorname {IQC}}$, go through as well. The obvious generalizations
-
How Did Avicenna Understand the Barcan Formulas? Log. J. IGPL (IF 1.0) Pub Date : 2022-08-24 Wilfrid Hodges
In 2003 Zia Movahed pointed to a passage of Avicenna, written probably in 1022, which Movahed claimed anticipated the modal formula of Barcan (that ‘For every $x$ necessarily $\phi $’ entails ‘Necessarily for every $x$$\phi $’), and its converse. Since 2003, examination of early logical writings of Avicenna has clarified how he understood entailments between modal sentences, using his own new temporal
-
First-Order Logic of Change Log. J. IGPL (IF 1.0) Pub Date : 2022-08-20 Kordula Świętorzecka
We present the first-order logic of change, which is an extension of the propositional logic of change $\textsf {LC}\Box $ developed and axiomatized by Świętorzecka and Czermak (2015, Log. et Anal., 232, 511–527). $\textsf {LC}\Box $ has two primitive operators: ${\mathcal {C}}$ to be read it changes whether and $\Box $ for constant unchangeability. It implements the philosophically grounded idea that
-
Online, Computable and Punctual Structure Theory Log. J. IGPL (IF 1.0) Pub Date : 2022-08-18 Matthew Askes, Rod Downey
Several papers (e.g. [7, 23, 42]) have recently sought to give general frameworks for online structures and algorithms ([4]), and seeking to connect, if only by analogy, online and computable structure theory. These initiatives build on earlier work on online colouring and other combinatorial algorithms by Bean [10], Kierstead, Trotter et al. [48, 54, 57] and others, as we discuss below. In this paper
-
Equivalence between Varieties of Łukasiewicz–Moisil Algebras and Rings Log. J. IGPL (IF 1.0) Pub Date : 2022-08-08 Blanca Fernanda López Martinolich, María del Carmen Vannicola
The Post, axled and Łukasiewicz–Moisil algebras are important lattices studied in algebraic logic. In this paper, we investigate a useful interpretation between these algebras and some rings. We give a term equivalence between Post algebras of order $p$ and $p$-rings, $p$ prime and lift this result to the axled Łukasiewicz–Moisil algebra $L \cong B_s \times P$ and the ring $\prod ^s F_2 \times \prod
-
Cyclic proofs for the first-order µ-calculus Log. J. IGPL (IF 1.0) Pub Date : 2022-08-04 Bahareh Afshari, Sebastian Enqvist, Graham E Leigh
We introduce a path-based cyclic proof system for first-order $\mu $-calculus, the extension of first-order logic by second-order quantifiers for least and greatest fixed points of definable monotone functions. We prove soundness of the system and demonstrate it to be as expressive as the known trace-based cyclic systems of Dam and Sprenger. Furthermore, we establish cut-free completeness of our system
-
Logical Foundations: Personal Perspective Log. J. IGPL (IF 1.0) Pub Date : 2022-07-28 Yuri Gurevich
We illustrate the glorious history of logical foundations and discuss the uncertain future.
-
Genuine paracomplete logics Log. J. IGPL (IF 1.0) Pub Date : 2022-07-23 Verónica Borja Macías, Marcelo E Coniglio, Alejandro Hernández-Tello
In 2016, Béziau introduces a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is genuine paraconsistent if it rejects the laws $\varphi ,\neg \varphi \vdash \psi $ and $\vdash \neg (\varphi \land \neg \varphi )$. In that paper, the author analyzes, among the three-valued logics, which of them satisfy this property. If we consider multiple-conclusion consequence relations
-
Restriction in Program Algebra Log. J. IGPL (IF 1.0) Pub Date : 2022-07-18 Marcel Jackson, Tim Stokes
We provide complete classifications of algebras of partial maps for a significant swathe of combinations of operations not previously classified. Our focus is the many subsidiary operations that arise in recent considerations of the ‘override’ and ‘update’ operations arising in specification languages. These other operations turn out to have an older pedigree: domain restriction, set subtraction and