## Found 47 Documents (Results 1–47)

100
MathJax

MSC:  03B53
Full Text:

MSC:  03B45
Full Text:

### Unification and admissible rules for paraconsistent minimal Johanssons’ logic J and positive intuitionistic logic $$\mathbf{IPC}^+$$. (English)Zbl 1323.03029

MSC:  03B53 03B25 68T15
Full Text:

MSC:  03B44
Full Text:

MSC:  03B44
Full Text:

### An explicit basis for admissible inference rules in table modal logics of width 2. (English. Russian original)Zbl 1241.03023

Algebra Logic 48, No. 1, 72-86 (2009); translation from Algebra Logika 48, No. 1, 122-148 (2009).
MSC:  03B45
Full Text:

### An explicit basis for the admissible inference rules of the modal logics extending S4.1 and Grz. (Russian, English)Zbl 1224.03003

Sib. Mat. Zh. 50, No. 4, 872-882 (2009); translation in Sib. Math. J. 50, No. 4, 692-699 (2009).
MSC:  03B45
Full Text:

### An explicit basis for admissible rules of modal logics of finite width. (Russian. English summary)Zbl 07324581

MSC:  03-XX 68-XX
Full Text:

### Bases of admissible rules for $$K$$-saturated logics. (English. Russian original)Zbl 1241.03033

Algebra Logic 47, No. 6, 420-425 (2008); translation from Algebra Logika 47, No. 6, 750-761 (2008).
MSC:  03B55 03B45
Full Text:

### Temporal logic with interacting agents. Decidability: theorems and admissible rules. (English)Zbl 1181.03016

MSC:  03B44 03B25 03B45
Full Text:

### Linear temporal logic with until and next, logical consecutions. (English)Zbl 1147.03008

MSC:  03B44 03B25 03B70
Full Text:

### Multi-modal and temporal logics with universal formula – reduction of admissibility to validity and unification. (English)Zbl 1149.03017

MSC:  03B44 03B45 03B25
Full Text:

### Branching time logics $$\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }$$ with operations Until and Since based on bundles of integer numbers, logical consecutions, deciding algorithms. (English)Zbl 1148.03011

MSC:  03B44 03B25 03B70
Full Text:

MSC:  03B45

### Until-since temporal logic based on parallel time with common past. Deciding algorithms. (English)Zbl 1132.03324

Artemov, Sergei N. (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72732-3/pbk). Lecture Notes in Computer Science 4514, 486-497 (2007).
MSC:  03B44
Full Text:

### Linear temporal logic with until and before on integer numbers, deciding algorithms. (English)Zbl 1185.03022

Grigoriev, Dima (ed.) et al., Computer science – theory and applications. First international computer science symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8–12, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34166-8/pbk). Lecture Notes in Computer Science 3967, 322-333 (2006).
MSC:  03B44 68Q60 68Q85
Full Text:

### Intransitive linear temporal logic based on integer numbers, decidability, admissible logical consecutions. (English)Zbl 1124.03006

Goncharov, S. S. (ed.) et al., Mathematical logic in Asia. Proceedings of the 9th Asian logic conference, Novosibirsk, Russia, August 16–19, 2005. Hackensack, NJ: World Scientific (ISBN 978-981-270-045-2/hbk). 233-253 (2006).
MSC:  03B44 03B25

### Admissible inference rules in the linear logic of knowledge and time LTK. (English)Zbl 1102.03009

MSC:  03B42 03B44 03B25
Full Text:

MSC:  03B44
Full Text:

### Logical consecutions in intransitive temporal linear logic of finite intervals. (English)Zbl 1091.03002

MSC:  03B44 03B25
Full Text:

### Logic of visibility, perception, and knowledge and admissible inference rules. (English)Zbl 1083.03021

MSC:  03B42 68T27 68T30
Full Text:

MSC:  03B45
Full Text:

### A resolution/tableaux algorithm for projective approximations in IPC. (English)Zbl 1005.03504

MSC:  03B35 68T15
Full Text:

### On the performance of subset selection rules under normality. (English)Zbl 0988.62010

MSC:  62F07 62F15
Full Text:

### Construction of an explicit basis for rules admissible in modal system S4. (English)Zbl 0992.03027

MSC:  03B45 03G25
Full Text:

### Describing a basis in semireduced form for inference rules of intuitionistic logic. (English. Russian original)Zbl 0973.03009

Algebra Logika 39, No. 6, 720-740 (2000); translation in Algebra Logic 39, No. 6, 412-422 (2000).
MSC:  03B20 03B55
Full Text:

### On self-admissible quasi-characterizing inference rules. (English)Zbl 0969.03032

MSC:  03B45 03B55
Full Text:

MSC:  03B45

### Finite bases with respect to admissibility for modal logics of width 2. (English. Russian original)Zbl 0930.03020

Algebra Logika 38, No. 4, 436-455 (1999); translation in Algebra Logic 38, No. 4, 237-247 (1999).
MSC:  03B45 03G25 08C15

### Independent bases for rules admissible in pretabular logics. (English)Zbl 0956.03024

MSC:  03B45 03B55 03C15
Full Text:

### Description of self-admissible quasi-characterizing inference rules. (English)Zbl 0973.03509

MSC:  03B45 03B55

### Finite bases of admissible inference rules for modal logics of width 2. (English)Zbl 0897.03016

MSC:  03B45 03G25 08C15

### Finite bases of admissible rules for the logic $$S 5_ 2 C$$. (English)Zbl 0887.03013

Adian, S. (ed.) et al., Logical foundations of computer science. 4th international symposium, LFCS ’97, Yaroslavl, Russia, July 6–12, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1234, 119-129 (1997).
MSC:  03B45

### Asymptotically optimal and admissible decision rules in compound compact Gaussian shift experiments. (English)Zbl 0853.62012

MSC:  62C25 62C15 62F35
Full Text:

### Bases of admissible inference rules in tabular modal logics of depth 2. (English. Russian original)Zbl 0972.03020

Algebra Logika 35, No. 5, 612-622 (1996); translation in Algebra Logic 35, No. 5, 344-349 (1996).

### Preserving of admissible inference rules in modal logic. (English)Zbl 0947.03025

Nerode, A. (ed.) et al., LFCS ’94, Logical foundations of computer science. 3rd International Symposium, St. Petersburg, Russia, July 11-14, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 813, 304-315 (1994).
MSC:  03B45

### Intermediate logics preserving admissible inference rules of Heyting calculus. (English)Zbl 0807.03017

MSC:  03B55 03B20
Full Text:

### What is an inference rule? (English)Zbl 0761.03010

Reviewer: G.Mints (Stanford)
Full Text:

### Semantic admissibility criteria for deduction rules in S4 and Int. (English. Russian original)Zbl 0745.03016

Math. Notes 50, No. 1, 714-718 (1991); translation from Mat. Zametki 50, No. 1, 84-91 (1991).
MSC:  03B45 03B20
Full Text:

### Semantic criteria for admissible inference rules in the logics S4 and Int. (Russian)Zbl 0729.03013

Reviewer: V.V.Rybakov
MSC:  03B45 03B20

### Logical equations and admissible rules of inference with parameters in modal provability logics. (English)Zbl 0729.03012

Reviewer: V.V.Rybakov
MSC:  03B45 03F40 03B25
Full Text:

### Robust fixed size confidence procedures for a restricted parameter space. (English)Zbl 0651.62024

MSC:  62F25 62F35 62C20
Full Text:

### Multiple classification rules for signs of parameters. (English)Zbl 0606.62033

Reviewer: J.Bartoszewicz
MSC:  62F99 62C25
Full Text:

### Decidability of the admissibility problem in layer-finite logics. (English. Russian original)Zbl 0576.03012

Algebra Logic 23, 75-87 (1984); translation from Algebra Logika 23, No. 1, 100-116 (1984).
MSC:  03B45 03B25
Full Text:

### Admissibility in finite problems. (English)Zbl 0472.62013

MSC:  62C15 62F10 62F15
Full Text:

### The credible distribution function is an admissible Bayes rule. (English)Zbl 0396.62081

MSC:  62P05 62G05 62F15
Full Text:

all top 5

all top 3