Algorithmic properties of QK4.3 and QS4.3

07/06/2023
by   M. Rybakov, et al.
0

We prove that predicate modal logics QK4.3 and QS4.3 are undecidable in languages with two individual variables, one modandic predicate letter, and one proposition letter.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2021

Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages

We study the algorithmic properties of first-order monomodal logics of f...
research
10/29/2020

The realizability of discs with ribbons on a Möbius strip

An hieroglyph on n letters is a cyclic sequence of the letters 1,2, . . ...
research
11/25/2021

A Letter on Convergence of In-Parameter-Linear Nonlinear Neural Architectures with Gradient Learnings

This letter summarizes and proves the concept of bounded-input bounded-s...
research
02/18/2020

Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata

We show the surprising result that the cutpoint isolation problem is dec...
research
03/12/2020

Comments on `Design and Implementation of Model-Predictive Control With Friction Compensation on an Omnidirectional Mobile Robot'

There are errors in the dynamics model in <cit.>. In addition, some deta...
research
03/13/2016

Learning Typographic Style

Typography is a ubiquitous art form that affects our understanding, perc...
research
04/29/2021

To code, or not to code, at the racetrack: Kelly betting and single-letter codes

For a gambler with side information, Kelly betting gives the optimal log...

Please sign up or login with your details

Forgot password? Click here to reset