Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Not every ``tabular predicate logic is finitely axiomatizable

From MaRDI portal
Publication:1378430
Jump to:navigation, search

DOI10.1023/A:1005088429206zbMath0920.03038OpenAlexW1545407035MaRDI QIDQ1378430

Dimitrij Skvortsov

Publication date: 16 March 1998

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005088429206


zbMATH Keywords

Kripke framefinite axiomatizablityintermediate predicate logicfunctor semantics


Mathematics Subject Classification ID

Intermediate logics (03B55)


Related Items

The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1378430&oldid=13527697"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki