LFCS - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 317

2022

A Non-hyperarithmetical Gödel LogicJuan P. Aguilera 0001, Jan Bydzovsky, David Fernández Duque. lfcs 2022: 1-8 [doi]

Parametric Church's Thesis: Synthetic Computability Without ChoiceYannick Forster 0002. lfcs 2022: 70-89 [doi]

Logical Foundations of Computer Science - International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, ProceedingsSergei N. Artëmov, Anil Nerode, editors, Volume 13137 of Lecture Notes in Computer Science, Springer, 2022. [doi]

Andrews Skolemization May Shorten Resolution Proofs Non-elementarilyMatthias Baaz, Anela Lolic. lfcs 2022: 9-24 [doi]

The Isomorphism Problem for FST Injection StructuresDouglas Cenzer, Richard Krogman. lfcs 2022: 25-36 [doi]

Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional LogicNeil J. DeBoer. lfcs 2022: 37-51 [doi]

Hyperarithmetical Worm BattlesDavid Fernández Duque, Konstnatinos Papafilippou, Joost J. Joosten. lfcs 2022: 52-69 [doi]

Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic LogicChristian Hagemeier, Dominik Kirst. lfcs 2022: 90-111 [doi]

A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information DistanceBjørn Kjos-Hanssen, Saroj Niraula, Soowhan Yoon. lfcs 2022: 112-124 [doi]

A Parameterized View on the Complexity of Dependence LogicJuha Kontinen, Arne Meier, Yasir Mahmood 0002. lfcs 2022: 125-142 [doi]

A Logic of Interactive ProofsDavid Lehnherr, Zoran Ognjanovic, Thomas Studer. lfcs 2022: 143-155 [doi]

Recursive Rules with Aggregation: A Simple Unified SemanticsYanhong A. Liu, Scott D. Stoller. lfcs 2022: 156-179 [doi]

Computational Properties of Partial Non-deterministic Matrices and Their LogicsSérgio Marcelino, Carlos Caleiro, Pedro Filipe. lfcs 2022: 180-197 [doi]

Soundness and Completeness Results for LEA and Probability SemanticsEoin Moore. lfcs 2022: 198-216 [doi]

On Inverse Operators in Dynamic Epistemic LogicShota Motoura, Shin-ya Katsumata. lfcs 2022: 217-235 [doi]

Betwixt Turing and KleeneDag Normann, Sam Sanders. lfcs 2022: 236-252 [doi]

Computability Models over Categories and PresheavesIosif Petrakis. lfcs 2022: 253-265 [doi]

Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite RepresentabilityDaniel Rogozin. lfcs 2022: 266-280 [doi]

Between Turing and KleeneSam Sanders. lfcs 2022: 281-300 [doi]

Propositional Dynamic Logic with Quantification over Regular Computation SequencesIgor Sedlár. lfcs 2022: 301-315 [doi]

Finite Generation and Presentation Problems for Lambda Calculus and Combinatory LogicRick Statman. lfcs 2022: 316-326 [doi]

Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint SystemsK. Subramani, Piotr J. Wojciechowski. lfcs 2022: 327-345 [doi]

Dialectica Logical PrinciplesDavide Trotta, Matteo Spadetto, Valeria de Paiva. lfcs 2022: 346-363 [doi]

Small Model Property Reflects in Games and AutomataMaciej Zielenkiewicz. lfcs 2022: 364-375 [doi]

2020

Parameterised Complexity of Abduction in Schaefer's FrameworkYasir Mahmood 0002, Arne Meier, Johannes Schmidt 0001. lfcs 2020: 195-213 [doi]

Completeness Theorems for First-Order Logic Analysed in Constructive Type TheoryYannick Forster 0002, Dominik Kirst, Dominik Wehr. lfcs 2020: 47-74 [doi]

Computability of Algebraic and Definable ClosureNathanael L. Ackerman, Cameron E. Freer, Rehana Patel. lfcs 2020: 1-11 [doi]

Observable ModelsSergei N. Artëmov. lfcs 2020: 12-26 [doi]

Logical Foundations of Computer Science - International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, ProceedingsSergei N. Artëmov, Anil Nerode, editors, Volume 11972 of Lecture Notes in Computer Science, Springer, 2020. [doi]

A Globally Sound Analytic Calculus for Henkin QuantifiersMatthias Baaz, Anela Lolic. lfcs 2020: 128-143 [doi]

Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal LogicsTiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel. lfcs 2020: 27-46 [doi]

On the Constructive Truth and Falsity in Peano ArithmeticHirohiko Kushida. lfcs 2020: 75-84 [doi]

Belief Expansion in Subset ModelsEveline Lehmann, Thomas Studer. lfcs 2020: 85-97 [doi]

Finitism, Imperative Programs and Primitive RecursionDaniel Leivant. lfcs 2020: 98-110 [doi]

Knowledge of Uncertain Worlds: Programming with Logical ConstraintsYanhong A. Liu, Scott D. Stoller. lfcs 2020: 111-127 [doi]

Feedback HyperjumpRobert S. Lubarsky. lfcs 2020: 144-155 [doi]

Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested SequentsTim Lyon. lfcs 2020: 156-176 [doi]

On Deriving Nested Calculi for Intuitionistic Logics from Semantic SystemsTim Lyon. lfcs 2020: 177-194 [doi]

Tracking Computability of GPAC-Generable FunctionsDiogo Poças, Jeffery I. Zucker. lfcs 2020: 214-235 [doi]

Modal Type Theory Based on the Intuitionistic Modal Logic $\mathbf{IEL}^{-}$Daniel Rogozin. lfcs 2020: 236-248 [doi]

Lifting Recursive Counterexamples to Higher-Order ArithmeticSam Sanders. lfcs 2020: 249-267 [doi]

On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux DeductionDan E. Willard. lfcs 2020: 268-286 [doi]

2018

The Completeness Problem for Modal LogicAntonis Achilleos. lfcs 2018: 1-21 [doi]

Justification Awareness ModelsSergei Artemov. lfcs 2018: 22-36 [doi]

Logical Foundations of Computer Science - International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8-11, 2018, ProceedingsSergei N. Artëmov, Anil Nerode, editors, Volume 10703 of Lecture Notes in Computer Science, Springer, 2018. [doi]

A Minimal Computational Theory of a Minimal Computational UniverseArnon Avron, Liron Cohen 0001. lfcs 2018: 37-54 [doi]

A Sequent-Calculus Based Formulation of the Extended First Epsilon TheoremMatthias Baaz, Alexander Leitsch, Anela Lolic. lfcs 2018: 55-71 [doi]

Angluin Learning via LogicSimone Barlocco, Clemens Kupke. lfcs 2018: 72-90 [doi]

A Universal Algebra for the Variable-Free Fragment of $${\mathrm {RC}^\nabla }$$ RC ∇Lev D. Beklemishev. lfcs 2018: 91-106 [doi]

A Logic of Blockchain UpdatesKai Brünnler, Dandolo Flumini, Thomas Studer. lfcs 2018: 107-119 [doi]

From Display to Labelled Proofs for Tense LogicsAgata Ciabattoni, Tim Lyon, Revantha Ramanayake. lfcs 2018: 120-139 [doi]

Dialectica Categories for the Lambek CalculusValeria de Paiva, Harley Eades III. lfcs 2018: 256-272 [doi]

Notions of Cauchyness and MetastabilityHannes Diener, Robert S. Lubarsky. lfcs 2018: 140-153 [doi]

A Gödel-Artemov-Style Analysis of Constructible FalsityThomas Macaulay Ferguson. lfcs 2018: 154-169 [doi]

Probabilistic Reasoning About Simply Typed Lambda TermsSilvia Ghilezan, Jelena Ivetic, Simona Kasterovic, Zoran Ognjanovic, Nenad Savic. lfcs 2018: 170-189 [doi]

Polyteam SemanticsMiika Hannula, Juha Kontinen, Jonni Virtema. lfcs 2018: 190-210 [doi]

On the Sharpness and the Single-Conclusion Property of Basic Justification ModelsVladimir N. Krupski. lfcs 2018: 211-220 [doi]

Founded Semantics and Constraint Semantics of Logic RulesYanhong A. Liu, Scott D. Stoller. lfcs 2018: 221-241 [doi]

Separating the Fan Theorem and Its Weakenings IIRobert S. Lubarsky. lfcs 2018: 242-255 [doi]

From Epistemic Paradox to Doxastic ArithmeticV. Alexis Peluce. lfcs 2018: 273-288 [doi]

A Natural Proof System for Herbrand's TheoremBenjamin Ralph. lfcs 2018: 289-308 [doi]

Metastability and Higher-Order ComputabilitySam Sanders. lfcs 2018: 309-330 [doi]

The Completeness of BCD for an Operational SemanticsRick Statman. lfcs 2018: 331-336 [doi]

A Tableau System for Instantial Neighborhood LogicJunhua Yu. lfcs 2018: 337-353 [doi]

Interpretations of Presburger Arithmetic in ItselfAlexander Zapryagaev, Fedor Pakhomov. lfcs 2018: 354-367 [doi]

2016

Modal Logics with Hard Diamond-Free FragmentsAntonis Achilleos. lfcs 2016: 1-13 [doi]

Pairing Traditional and Generic Common KnowledgeEvangelia Antonakos. lfcs 2016: 14-26 [doi]

On Aggregating Probabilistic EvidenceSergei N. Artëmov. lfcs 2016: 27-42 [doi]

Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. ProceedingsSergei N. Artëmov, Anil Nerode, editors, Volume 9537 of Lecture Notes in Computer Science, Springer, 2016. [doi]

Classical Logic with Mendler Induction - A Dual Calculus and Its Strong NormalizationMarco Devesas Campos, Marcelo P. Fiore. lfcs 2016: 43-59 [doi]

Index Sets for Finite Normal Predicate Logic Programs with Function SymbolsDouglas A. Cenzer, Victor W. Marek, Jeffrey B. Remmel. lfcs 2016: 60-75 [doi]

Multiple Conclusion Rules in Logics with the Disjunction PropertyAlex Citkin. lfcs 2016: 76-89 [doi]

The Online Space Complexity of Probabilistic LanguagesNathanaël Fijalkow. lfcs 2016: 106-116 [doi]

Type Theoretical DatabasesHenrik Forssell, Håkon Robbestad Gylterud, David I. Spivak. lfcs 2016: 117-129 [doi]

Augmenting Subset Spaces to Cope with Multi-agent KnowledgeBernhard Heinemann. lfcs 2016: 130-145 [doi]

Multiple Conclusion Linear Logic: Cut Elimination and MoreHarley Eades III, Valeria de Paiva. lfcs 2016: 90-105 [doi]

On Lambek's Restriction in the Presence of Exponential ModalitiesMax I. Kanovich, Stepan Kuznetsov, Andre Scedrov. lfcs 2016: 146-158 [doi]

A Quest for Algorithmically Random Infinite Structures, IIBakhadyr Khoussainov. lfcs 2016: 159-173 [doi]

Probabilistic Justification LogicIoannis Kokkinis, Zoran Ognjanovic, Thomas Studer. lfcs 2016: 174-186 [doi]

Sequent Calculus for Intuitionistic Epistemic Logic IELVladimir N. Krupski, Alexey Yatmanov. lfcs 2016: 187-201 [doi]

Interpolation Method for Multicomponent Sequent CalculiRoman Kuznets. lfcs 2016: 202-218 [doi]

Adjoint Logic with a 2-Category of ModesDaniel R. Licata, Michael Shulman. lfcs 2016: 219-235 [doi]

Parallel Feedback Turing ComputabilityRobert S. Lubarsky. lfcs 2016: 236-250 [doi]

Compactness in the Theory of Continuous AutomataScott Messick. lfcs 2016: 251-266 [doi]

Measure Quantifier in Monadic Second Order LogicHenryk Michalewski, Matteo Mio. lfcs 2016: 267-282 [doi]

A Cut-Free Labelled Sequent Calculus for Dynamic Epistemic LogicShoshin Nomura, Hiroakira Ono, Katsuhiko Sano. lfcs 2016: 283-298 [doi]

The Urysohn Extension Theorem for Bishop SpacesIosif Petrakis. lfcs 2016: 299-316 [doi]

An Arithmetical Interpretation of Verification and Intuitionistic KnowledgeTudor Protopopescu. lfcs 2016: 317-330 [doi]

Definability in First Order Theories of Graph OrderingsRamaswamy Ramanujam, R. S. Thinniyam. lfcs 2016: 331-348 [doi]

The Complexity of Disjunction in Intuitionistic LogicR. Ramanujam, Vaishnavi Sundararajan, S. P. Suresh. lfcs 2016: 349-363 [doi]

Intransitive Temporal Multi-agent's Logic, Knowledge and Uncertainty, PlausibilityVladimir V. Rybakov. lfcs 2016: 364-375 [doi]

Ogden Property for Linear Displacement Context-Free GrammarsAlexey Sorokin. lfcs 2016: 376-391 [doi]

Levy Labels and Recursive TypesRick Statman. lfcs 2016: 392-406 [doi]

Links

Filter by Year
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

LFCS (lfcs)

Viewing Publication 1 - 100 from 317

2022

2020

2018

2016

2013

Links

Filter by YearOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

LFCS (lfcs)

Viewing Publication 1 - 100 from 317

2022

2020

2018

2016

2013

Filter by Year
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1